Harper-type lower bounds and the bandwidths of the compositions of graphs

DOI10.1016/S0012-365X(97)00040-XzbMath0903.05043MaRDI QIDQ1381861

Jinjiang Yuan, Sanming Zhou

Publication date: 13 October 1998

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

labelingbandwidthcomposition graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (2)

Bandwidth of the composition of two graphs. ⋮ Bounding the bandwidths for graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal labelling of a product of two paths
• The NP-completeness of the bandwidth minimization problem
• The bandwidth problem for graphs and matrices—a survey
• Complexity Results for Bandwidth Minimization
• Optimal numberings and isoperimetric problems on graphs
• A remark on a problem of Harary

This page was built for publication: Harper-type lower bounds and the bandwidths of the compositions of graphs