Characterization of graphs with equal bandwidth and cyclic bandwidth

DOI10.1016/S0012-365X(00)00379-4MaRDI QIDQ5957762zbMATH OpenOpenAlexFDO

Authors P. C. B. Lam, Wai Chee Shiu, W. H. Chan

Publication date 10 October 2002

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(00)00379-4

zbMATH Keywords

bandwidthcharacterizationconvex triangulation meshescyclic bandwidth

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Review text

The authors provide a characterization of graphs with equal bandwidth and cyclic bandwidth. Certain classes of graphs are shown to have the property.

Recommendations

• Publication:4940077
• Cyclic bandwidth sum of graphs
• scientific article; zbMATH DE number 3859182
• scientific article; zbMATH DE number 1696538
• Laplacian spectral characterizations of graphs with even cyclic
• Bandwidth of convex bipartite graphs and related graphs
• Bandwidth of convex bipartite graphs and related graphs
• scientific article; zbMATH DE number 3732090
• On bandwidth sums of graphs
• scientific article; zbMATH DE number 3861212

Cited in

(6)

• Cyclic bandwidth with an edge added
• A study on cyclic bandwidth sum
• Tabu search for the cyclic bandwidth problem
• On semidefinite programming bounds for graph bandwidth
• Cyclic bandwidth sum of graphs
• A multi-start variable neighborhood tabu search algorithm for the cyclic bandwidth problem

This page was built for publication: Characterization of graphs with equal bandwidth and cyclic bandwidth

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5957762)