On spanning tree congestion of Hamming graphs

2011/10/06 by Kyohei Kozawa, Yota Otachi, Kozawa, Kyohei +1 · 1 citation
Computer Science · Engineering · #Advanced Graph Theory Research #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #Interconnection Networks and Systems #VLSI and FPGA Design Techniques #cs.DM

paper · pdf · doi:10.48550/arxiv.1110.1304

3 pages, fixed typos again

openalex publication_date 2011/10/06 · arxiv created 2011/10/17 · arxiv updated 2011/10/18 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We present a tight lower bound for the spanning tree congestion of Hamming graphs.

Cited by

• Minimal L^p-congestion spanning trees on weighted graphs

Related

• Spanning Tree Congestion and Computation of Generalized Győri-Lovász Partition
• Minimal L^p-congestion spanning trees on weighted graphs
• Parameterized Spanning Tree Congestion
• Approximation of Spanning Tree Congestion using Hereditary Bisection
• Quantitative characteristics of cycles and their relations with stretch and spanning tree congestion