scientific article; zbMATH DE number 90113

MaRDI QIDQ4018353zbMATH OpenFDO

Authors U. Hendrich, Michael Stiebitz

Publication date 16 January 1993

zbMATH Keywords

bandwidthgraph products

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1185297
• Bandwidth of the strong product of two connected graphs
• Bandwidth of the Cartesian product of two connected graphs
• scientific article; zbMATH DE number 3926971
• scientific article; zbMATH DE number 888848

Cited in

(16)

• On the bandwidth of a Hamming graph
• Bandwidth of the Cartesian product of two connected graphs
• The bandwidth sum of join and composition of graphs
• New results on edge-bandwidth
• On bandwidth and edgesum for the composition of two graphs
• Bandwidth of the strong product of two connected graphs
• Bandwidth of direct products of paths and cycles
• scientific article; zbMATH DE number 3859182 (Why is no real title available?)
• scientific article; zbMATH DE number 5016629 (Why is no real title available?)
• Edge Addition Number of Cartesian Product of Paths and Cycles
• scientific article; zbMATH DE number 3926971 (Why is no real title available?)
• scientific article; zbMATH DE number 1185297 (Why is no real title available?)
• scientific article; zbMATH DE number 857606 (Why is no real title available?)
• scientific article; zbMATH DE number 888848 (Why is no real title available?)
• Bandwidth of graphs resulting from the edge clique covering problem
• On bandwidth for the tensor product of paths and cycles

This page was built for publication:

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