On the bandwidth of 3-dimensional Hamming graphs

DOI10.1016/J.TCS.2008.07.029MaRDI QIDQ955026zbMATH OpenOpenAlexFDO

Authors József Balogh, Sergej L. Bezrukov, Lawrence H. Harper, Ákos Seress

Publication date 18 November 2008

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2008.07.029

zbMATH Keywords

combinatorial optimization

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27)

Recommendations

• On the bandwidth of a Hamming graph
• Bounding the bandwidths for graphs
• Antibandwidth and cyclic antibandwidth of Hamming graphs
• Antibandwidth and cyclic antibandwidth of Hamming graphs
• scientific article; zbMATH DE number 3861212

Cites work

• Design of multiple description scalar quantizers
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2060183 (Why is no real title available?)
• Index assignment for multichannel communication under failure
• Index Assignment for Two-Channel Quantization
• On an isoperimetric problem for Hamming graphs
• On the bandwidth of a Hamming graph
• On the variance of Shannon products of graphs
• Optimal numberings and isoperimetric problems on graphs
• The bandwidth problem for graphs and matrices—a survey

Cited in

(7)

• On the bandwidth of a Hamming graph
• Antibandwidth and cyclic antibandwidth of Hamming graphs
• On the variance of Shannon products of graphs
• Antibandwidth and cyclic antibandwidth of Hamming graphs
• Asymptotic Determination of Edge-Bandwidth of Multidimensional Grids and Hamming Graphs
• Treewidth of Cartesian products of highly connected graphs
• Bandwidth of graphs resulting from the edge clique covering problem

This page was built for publication: On the bandwidth of 3-dimensional Hamming graphs

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