Computer Science – Discrete Mathematics
Scientific paper
2011-10-06
Computer Science
Discrete Mathematics
3 pages, fixed typos again
Scientific paper
We present a tight lower bound for the spanning tree congestion of Hamming
graphs.
Kozawa Kyohei
Otachi Yota
No associations
LandOfFree
On spanning tree congestion of Hamming graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On spanning tree congestion of Hamming graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On spanning tree congestion of Hamming graphs will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-181808