Bandwidth of the composition of two graphs.

DOI10.1016/S0012-365X(03)00131-6zbMATH Open1035.05081MaRDI QIDQ1406563FDOQ1406563

Authors: Toru Kojima 

Publication date: 4 September 2003

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

Recommendations

• Harper-type lower bounds and the bandwidths of the compositions of graphs
• The bandwidth sum of join and composition of graphs
• scientific article; zbMATH DE number 786174
• On bandwidth and edgesum for the composition of two graphs
• On bandwidth sums of graphs

zbMATH Keywords

DiameterDensityBandwidthComposition

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Optimal numberings and isoperimetric problems on graphs
• The NP-completeness of the bandwidth minimization problem
• Bandwidth and density for block graphs
• 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
• Bandwidth of the complete \(k\)-ary tree
• The bandwidth problem for graphs and matrices—a survey
• The Bandwidth Problem: critical Subgraphs and the Solution for Caterpillars
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Harper-type lower bounds and the bandwidths of the compositions of graphs
• On bandwidth and edgesum for the composition of two graphs

Cited In (6)

• On bandwidth and edgesum for the composition of two graphs
• Title not available (Why is that?)
• The bandwidth sum of join and composition of graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

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

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