Arc index of spatial graphs

DOI10.1002/JGT.22404MaRDI QIDQ4630000zbMATH OpenOpenAlexFDO

Authors Minjung Lee, Sungjong No, Seungsang Oh

Publication date 28 March 2019

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1711.08116

zbMATH Keywords

arc indexspatial graphupper bound

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62)

Abstract: 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)$ of any spatial graph $G$ as ${\displaystyle }$alpha(G) leq c(G)+e+b,${\displaystyle }$ 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.

Recommendations

• An upper bound of arc index of links
• Arc index via the alternating tangle decomposition
• Embedding knots and links in an open book II. Bounds on arc index
• PRIME KNOTS WITH ARC INDEX UP TO 11 AND AN UPPER BOUND OF ARC INDEX FOR NON-ALTERNATING KNOTS
• Stick number of spatial graphs

Cited in

(1)

• Bisected vertex leveling of plane graphs: braid index, arc index and delta diagrams

This page was built for publication: Arc index of spatial graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4630000)