- Current Issue - Ahead of Print Articles - All Issues - Search - Open Access - Information for Authors - Downloads - Guideline - Regulations ㆍPaper Submission ㆍPaper Reviewing ㆍPublication and Distribution - Code of Ethics - For Authors ㆍOnlilne Submission ㆍMy Manuscript - For Reviewers - For Editors
 Enumeration of optimally labelled graphs of bandwidth 2 Bull. Korean Math. Soc. 2017 Vol. 54, No. 6, 1883-1891 https://doi.org/10.4134/BKMS.b160168Published online November 30, 2017 Gab-Byung Chae, MinSeok Cheong, Sang-Mok Kim Wonkwang University, Korea University, Kwangwoon University 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 MSC numbers : 05C30 Downloads: Full-text PDF