| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4649025 | Discrete Mathematics | 2010 | 10 Pages |
Abstract
The carving-width of a graph is the minimum congestion of routing trees for the graph. We determine the carving-width of generalized hypercubes: Hamming graphs, even grids, and tori. Our results extend the result of Chandran and Kavitha [L.S. Chandran, T. Kavitha, The carvingwidth of hypercubes, Discrete Math. 306 (2006) 2270–2274] that determines the carving-width of hypercubes.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Kyohei Kozawa, Yota Otachi, Koichi Yamazaki,