Bandwidth of the strong product of two connected graphs

DOI10.1016/j.disc.2007.03.074zbMath1144.05057OpenAlexW1974304658MaRDI QIDQ2470005

Toru Kojima

Publication date: 11 February 2008

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

Full work available at URL: https://doi.org/10.1016/j.disc.2007.03.074

zbMATH Keywords

graphbandwidthdistancediameterstrong product

Mathematics Subject Classification ID

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

Related Items (1)

On the geodetic and the hull numbers in strong product graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The NP-completeness of the bandwidth minimization problem
• Bandwidth of the Cartesian product of two connected graphs
• Bandwidth of the complete \(k\)-ary tree
• The bandwidth problem for graphs and matrices—a survey
• Complexity Results for Bandwidth Minimization
• A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs

This page was built for publication: Bandwidth of the strong product of two connected graphs