Arc index of spatial graphs

Bae and Park found an upper bound on the arc index of prime links in terms of the minimal crossing number. In this paper, we extend the definition of the arc presentation to spatial graphs and find an upper bound on the arc index $\alpha (G)$ofanyspatialgraph$G$as$$\alpha (G)\le c(G)+e+b,$$where$c(G)$ is the minimal crossing number of $G$, $e$ is the number of edges, and $b$ is the number of bouquet cut-components. This upper bound is lowest possible.