Minimum bandwidth problem for embedding graphs in cycles

Journal Article


For the bandwidth B(G) and the cyclic bandwidth Bc(G) of a graph G, it is known that ½B(G) ≤ Bc(G) ≤ B(G). In this paper, the criterion conditions for two extreme cases Bc(G) = B(G) and Bc(G) = ½B(G) are studied. From this, some exact values of Bc(G) for special graphs can be obtained. © 1997 John Wiley & Sons, Inc. Networks 29: 135–140, 1997

Related Topics

Related Publications

Related Content

Site Footer


This website is provided by John Wiley & Sons Limited, The Atrium, Southern Gate, Chichester, West Sussex PO19 8SQ (Company No: 00641132, VAT No: 376766987)

Published features on are checked for statistical accuracy by a panel from the European Network for Business and Industrial Statistics (ENBIS)   to whom Wiley and express their gratitude. This panel are: Ron Kenett, David Steinberg, Shirley Coleman, Irena Ograjenšek, Fabrizio Ruggeri, Rainer Göb, Philippe Castagliola, Xavier Tort-Martorell, Bart De Ketelaere, Antonio Pievatolo, Martina Vandebroek, Lance Mitchell, Gilbert Saporta, Helmut Waldl and Stelios Psarakis.