On bandwidth for the tensor product of paths and cycles

DOI10.1016/S0166-218X(95)00005-CzbMath0869.05056OpenAlexW2027606473WikidataQ127809402 ScholiaQ127809402MaRDI QIDQ678881

Yung-Ling Lai, Kenneth L. Williams

Publication date: 14 August 1997

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

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

bandwidthtensor product

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (1)

Edge Addition Number of Cartesian Product of Paths and Cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal labelling of a product of two paths
• The NP-completeness of the bandwidth minimization problem
• The Kronecker Product of Graphs
• The bandwidth problem for graphs and matrices—a survey
• Complexity Results for Bandwidth Minimization
• Optimal numberings and isoperimetric problems on graphs
• The Categorical Product of Graphs
• A remark on a problem of Harary

This page was built for publication: On bandwidth for the tensor product of paths and cycles