Bandwidth of the corona of two graphs

DOI10.1016/J.DISC.2007.07.071MaRDI QIDQ932628zbMATH OpenOpenAlexFDO

Authors 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

distancebandwidthcoronadiameterconnectivity

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 436077
• On bandwidth and edgesum for the composition of two graphs
• Bandwidth of the Cartesian product of two connected graphs
• scientific article; zbMATH DE number 140091
• On the basis number of the corona of graphs

Cites work

• scientific article; zbMATH DE number 436077 (Why is no real title available?)
• scientific article; zbMATH DE number 4070955 (Why is no real title available?)
• A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
• Bandwidth of the Cartesian product of two connected graphs
• Complexity Results for Bandwidth Minimization
• The NP-completeness of the bandwidth minimization problem
• The bandwidth problem for graphs and matrices—a survey

Cited in

(2)

• Bandwidth of the Cartesian product of two connected graphs
• scientific article; zbMATH DE number 436077 (Why is no real title available?)

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

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