부산대학교 도서관

To link to full-text access for this article, visit this link: http://dx.doi.org/10.1016/j.dam.2007.09.011 Byline: W.H. Chan, Peter C.B. Lam, W.C. Shiu Abstract: B.sub.c(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[member of]E[G] as follows: B.sub.c(G+e)=(2B.sub.c(G)ifB.sub.c(G)a[c]1/2p/8,(1/3((p/2)+2B.sub.c(G)))ifB.sub.c(G)p/8.) We also show that this bound is sharp. Author Affiliation: Department of Mathematics, Hong Kong Baptist University, Kowloon, Hong Kong Article History: Received 8 May 2007; Revised 4 September 2007; Accepted 10 September 2007 Article Note: (footnote) [star] Partially supported by Faculty Research Grant (FRG/06-07/II-28), Hong Kong Baptist University and CERG (HKBU210207), Research Grant Council, Hong Kong.