Arc index of spatial graphs
- Authors
- Lee, Min Jung; No, Sungjong; Oh, Seungsang
- Issue Date
- 3월-2019
- Publisher
- WILEY
- Keywords
- arc index; spatial graph; upper bound
- Citation
- JOURNAL OF GRAPH THEORY, v.90, no.3, pp.406 - 415
- Indexed
- SCIE
SCOPUS
- Journal Title
- JOURNAL OF GRAPH THEORY
- Volume
- 90
- Number
- 3
- Start Page
- 406
- End Page
- 415
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/67237
- DOI
- 10.1002/jgt.22404
- ISSN
- 0364-9024
- 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 alpha(G) <= 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.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Science > Department of Mathematics > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.