On the bandwidth of a Hamming graph

DOI10.1016/S0304-3975(03)00052-5zbMath1016.05062MaRDI QIDQ1400004

Lawrence H. Harper

Publication date: 30 July 2003

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

zbMATH Keywords

combinatorial optimizationmultichannel transmission of data packets

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items

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, On the bandwidth of 3-dimensional Hamming graphs, Multi-hop all-to-all optical routings in Cartesian product networks, The carving-width of generalized hypercubes, The carvingwidth of hypercubes

Cites Work

• Unnamed Item
• Unnamed Item
• On an isoperimetric problem for Hamming graphs
• The bandwidth problem for graphs and matrices—a survey
• Index assignment for multichannel communication under failure
• Optimal numberings and isoperimetric problems on graphs