Asymptotic Determination of Edge-Bandwidth of Multidimensional Grids and Hamming Graphs

DOI10.1137/060660291zbMATH Open1188.05105OpenAlexW2000023511MaRDI QIDQ3629454FDOQ3629454

Authors: Reza Akhtar, Tao Jiang, Z. Miller 

Publication date: 27 May 2009

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

Full work available at URL: https://doi.org/10.1137/060660291

Recommendations

• On the edge-bandwidth of graph products
• Edge-bandwidth of grids and tori
• scientific article; zbMATH DE number 867648
• scientific article; zbMATH DE number 3963886
• On the bandwidth of 3-dimensional Hamming graphs

zbMATH Keywords

gridboundarybandwidthHamming graphisoperimetric problemedge-bandwidth

Mathematics Subject Classification ID

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

Cited In (9)

• On the bandwidth of a Hamming graph
• Bandwidth edge counts for linear arrangements of rectangular grids
• Edge-bandwidth of grids and tori
• New bounds on the edge-bandwidth of triangular grids
• Title not available (Why is that?)
• On the edge-bandwidth of graph products
• Antibandwidth of three-dimensional meshes
• Bandwidth of graphs resulting from the edge clique covering problem
• The edge-diametric theorem in Hamming spaces

This page was built for publication: Asymptotic Determination of Edge-Bandwidth of Multidimensional Grids and Hamming Graphs

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