On the bandwidth of 3-dimensional Hamming graphs

DOI10.1016/j.tcs.2008.07.029zbMath1151.90038OpenAlexW2032965928MaRDI QIDQ955026

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

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)

Related Items (4)

Treewidth of Cartesian Products of Highly Connected Graphs ⋮ Antibandwidth and cyclic antibandwidth of Hamming graphs ⋮ Bandwidth of graphs resulting from the edge clique covering problem ⋮ On the variance of Shannon products of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• On an isoperimetric problem for Hamming graphs
• On the bandwidth of a Hamming graph
• On the variance of Shannon products of graphs
• Index Assignment for Two-Channel Quantization
• The bandwidth problem for graphs and matrices—a survey
• Design of multiple description scalar quantizers
• Index assignment for multichannel communication under failure
• Optimal numberings and isoperimetric problems on graphs

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