[KSCI] Korea Science Citation Index Service

http://dx.doi.org/10.4134/BKMS.b160168

ENUMERATION OF OPTIMALLY LABELLED GRAPHS OF BANDWIDTH 2

Chae, Gab-Byung (Division of Mathematics and Informational Statistics Wonkwang University)
Cheong, MinSeok (College of Informatics, Information Security Convergence Korea University)
Kim, Sang-Mok (Department of Mathematics Kwangwoon University)

Publication Information

Bulletin of the Korean Mathematical Society / v.54, no.6, 2017 , pp. 1883-1891 More about this Journal

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){\rightarrow}[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.

Keywords

enumeration; linear discrepancy; bandwidth;

Citations & Related Records

Reference

1	A. Caprara, F. Malucelli, and D. Pretolani, On bandwidth-2 graphs, Discrete Appl. Math. 17 (2002), no. 1-3, 1-13. DOI
2	G.-B. Chae, M. Cheong, and S.-M. Kim, Irreducible posets of linear discrepancy 1 and 2, Far East J. Math. Sci. (JMS) 22 (2006), no. 2, 217-226.
3	G.-B. Chae, Graph bandwidth with irreducibility, Preprint.