Lattice stick number of spatial graphs
- Authors
- Yoo, Hyungkee; Lee, Chaeryn; Oh, Seungsang
- Issue Date
- 7월-2018
- Publisher
- WORLD SCIENTIFIC PUBL CO PTE LTD
- Keywords
- Graph; lattice stick number; upper bound
- Citation
- JOURNAL OF KNOT THEORY AND ITS RAMIFICATIONS, v.27, no.8
- Indexed
- SCIE
SCOPUS
- Journal Title
- JOURNAL OF KNOT THEORY AND ITS RAMIFICATIONS
- Volume
- 27
- Number
- 8
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/74430
- DOI
- 10.1142/S0218216518500487
- ISSN
- 0218-2165
- Abstract
- The lattice stick number of knots is defined to be the minimal number of straight sticks in the cubic lattice required to construct a lattice stick presentation of the knot. We similarly define the lattice stick number s(L)(G) of spatial graphs G with vertices of degree at most six (necessary for embedding into the cubic lattice), and present an upper bound in terms of the crossing number c(G) s(L)(G) <= 3c(G) + 6e - 4v - 2s + 3b + k, where G has e edges, v vertices, s cut-components, b bouquet cut-components, and k knot components.
- 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.