Premium
Minimum bandwidth problem for embedding graphs in cycles
Author(s) -
Lin Yixun
Publication year - 1997
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/(sici)1097-0037(199705)29:3<135::aid-net1>3.0.co;2-i
Subject(s) - combinatorics , bandwidth (computing) , embedding , mathematics , graph , computer science , discrete mathematics , computer network , artificial intelligence
For the bandwidth B(G) and the cyclic bandwidth B c (G) of a graph G, it is known that ½B(G) ≤ B c (G) ≤ B(G). In this paper, the criterion conditions for two extreme cases B c (G) = B(G) and B c (G) = ½B(G) are studied. From this, some exact values of B c (G) for special graphs can be obtained. © 1997 John Wiley & Sons, Inc. Networks 29: 135–140, 1997