상세 보기
초록
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.
키워드
enumeration; linear discrepancy; bandwidth
- 제목
- ENUMERATION OF OPTIMALLY LABELLED GRAPHS OF BANDWIDTH 2
- 저자
- Chae, Gab-Byung; Cheong, MinSeok; Kim, Sang-Mok
- 발행일
- 2017
- 유형
- Article
- 저널명
- 대한수학회보
- 권
- 54
- 호
- 6
- 페이지
- 1883 ~ 1891