Bandwidth of the corona of two graphs

DOI10.1016/J.DISC.2007.07.071zbMath1170.05050OpenAlexW2089651515MaRDI QIDQ932628

Toru Kojima

Publication date: 11 July 2008

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

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

zbMATH Keywords

coronabandwidthdistancediameterconnectivity

Mathematics Subject Classification ID

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

Cites Work

• The NP-completeness of the bandwidth minimization problem
• Bandwidth of the Cartesian product of two connected graphs
• 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
• Unnamed Item
• Unnamed Item

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