| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 420847 | Discrete Applied Mathematics | 2008 | 7 Pages |
Abstract
Bc(G)Bc(G) denotes the cyclic bandwidth of graph G. In this paper, we obtain the maximum cyclic bandwidth of graphs of order p with adding an edge e∈E[G¯] as follows:Bc(G+e)=2Bc(G)ifBc(G)⩽p8,13p2+2Bc(G)ifBc(G)>p8.We also show that this bound is sharp.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
W.H. Chan, Peter C.B. Lam, W.C. Shiu,