Detailed Information
Cited 0 time in 
Cited 0 time in 
Cited 0 time in
Metadata Downloads
ENUMERATION OF OPTIMALLY LABELLED GRAPHS OF BANDWIDTH 2
- Authors
- Chae, Gab-Byung; Cheong, MinSeok; Kim, Sang-Mok
- Issue Date
- 2017
- Publisher
- KOREAN MATHEMATICAL SOC
- Keywords
- enumeration; linear discrepancy; bandwidth
- Citation
- BULLETIN OF THE KOREAN MATHEMATICAL SOCIETY, v.54, no.6, pp.1883 - 1891
- Indexed
- SCIE
SCOPUS
KCI
- Journal Title
- BULLETIN OF THE KOREAN MATHEMATICAL SOCIETY
- Volume
- 54
- Number
- 6
- Start Page
- 1883
- End Page
- 1891
- ISSN
- 1015-8634
- Abstract
- An optimally labelled graph of bandwidth 2 is an ordered pair (G, f) where G is a simple graph with bw (G) = 2 and f : V (G) -> [n] is a bijection such that bw(G, f) = 2. In this paper, the number of optimally labelled graphs of bandwidth two of order n is enumerated by counting linear forests.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - ETC > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.