论文信息 - Cyclic bandwidth sum of graphs

Cyclic bandwidth sum of graphs

Let G be a simple graph. The cyclic bandwidth sum problem is to determine a labeling of graph G in a cycle such that the total length of edges is as small as possible. In this paper, some upper and lower bounds on cyclic bandwidth sum of graphs are studied.

Hao Jianxiu

[1] Frank Thomson Leighton,et al. A Framework for Solving VLSI Graph Layout Problems , 1983, J. Comput. Syst. Sci..

[2] J. A. Bondy,et al. Graph Theory with Applications , 1978 .

[3] Yixun Lin. Minimum bandwidth problem for embedding graphs in cycles , 1997 .