Bandwidth of the composition of two graphs.

DOI10.1016/S0012-365X(03)00131-6zbMath1035.05081MaRDI QIDQ1406563

Toru Kojima

Publication date: 4 September 2003

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

zbMATH Keywords

BandwidthDiameterDensityComposition

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The NP-completeness of the bandwidth minimization problem
• Harper-type lower bounds and the bandwidths of the compositions of graphs
• Bandwidth and density for block graphs
• Bandwidth of the complete \(k\)-ary tree
• On bandwidth and edgesum for the composition of two graphs
• The bandwidth problem for graphs and matrices—a survey
• The Bandwidth Problem: critical Subgraphs and the Solution for Caterpillars
• The Bandwidth of Caterpillars with Hairs of Length 1 and 2
• Complexity Results for Bandwidth Minimization
• A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
• Optimal numberings and isoperimetric problems on graphs

This page was built for publication: Bandwidth of the composition of two graphs.