Name
Abstract | ||
|---|---|---|
We study the combinatorial problem of finding an arrangement of distinct integers into the d-dimensional N-cube so that the maximal variance of the numbers on each ℓ-dimensional section is minimized. Our main tool is an inequality on the Laplacian of a Shannon product of graphs, which might be a subject of independent interest. We describe applications of the inequality to multiple description scalar quantizers (MDSQ), to get bounds on the bandwidth of products of graphs, and to balance edge-colorings of regular, d-uniform, d-partite hypergraphs. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1016/j.dam.2007.09.008 | Discrete Applied Mathematics |
Keywords | DocType | Volume |
Labeling,Variance,Graph product | Journal | 156 |
Issue | ISSN | Citations |
1 | 0166-218X | 3 |
PageRank | References | Authors |
0.53 | 7 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| József Balogh | 1 | 862 | 89.91 |
| Clifford Smyth | 2 | 24 | 6.91 |