On spanning tree congestion of Hamming graphs
Kyohei Kozawa, Yota Otachi
TL;DR
This paper establishes a precise lower bound for the spanning tree congestion in Hamming graphs, advancing understanding of their network flow properties.
Contribution
It provides the first tight lower bound for spanning tree congestion specifically in Hamming graphs, a significant step in graph theory.
Findings
Derived a tight lower bound for Hamming graphs
Enhanced understanding of network flow in Hamming graphs
Contributed to graph congestion theory
Abstract
We present a tight lower bound for the spanning tree congestion of Hamming graphs.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsInterconnection Networks and Systems · Advanced Graph Theory Research · VLSI and FPGA Design Techniques