×

On the edge-bandwidth of graph products. (English) Zbl 1098.05070

Summary: The edge-bandwidth of a graph \(G\) is the bandwidth of the line graph of \(G\). We show asymptotically tight bounds on the edge-bandwidth of two-dimensional grids and tori, the product of two cliques and the \(n\)-dimensional hypercube.

MSC:

05C78 Graph labelling (graceful graphs, bandwidth, etc.)
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Balogh, J.; Csirik, J. A., Index assignment for two-channel quantization, IEEE Trans. Inform. Theory, 11, 2737-2751 (2004) · Zbl 1284.94042
[2] Bezrukov, S.; Grünwald, N.; Weber, K., On edge numberings of the \(n\)-cube graph, Discrete Appl. Math., 46, 99-116 (1993) · Zbl 0786.05047
[3] Calamoneri, T.; Massini, A.; Vrťo, I., New results on edge-bandwidth, Theoret. Comput. Sci., 307, 503-513 (2003) · Zbl 1070.68115
[4] Chinn, P. Z.; Chvátalová, J.; Dewdney, A. K.; Gibbs, N. E., The bandwidth problem for graphs and matrices—a survey, J. Graph Theory, 6, 223-254 (1982) · Zbl 0494.05057
[5] Chung, F. R.K., Labelings of graphs, (Beineke, L. W.; Wilson, R. J., Selected Topics in Graph Theory, Vol. 3 (1988), Academic Press: Academic Press San Diego, CA), 151-168 · Zbl 0656.05058
[6] Chvátalová, J., Optimal labelling of a product of two paths, Discrete Math., 11, 249-253 (1975) · Zbl 0299.05113
[7] Harper, L. H., Optimal numberings and isoperimetric problems on graphs, J. Combin. Theory, 1, 385-393 (1966) · Zbl 0158.20802
[8] L.H. Harper, Global Methods for Combinatorial Isoperimetric Problems, Cambridge University Press, Cambridge, 2004, 232pp.; L.H. Harper, Global Methods for Combinatorial Isoperimetric Problems, Cambridge University Press, Cambridge, 2004, 232pp. · Zbl 1043.05002
[9] Hochberg, R.; McDiarmid, C.; Saks, M., On the bandwidth of triangulated triangles, Discrete Math., 138, 261-265 (1995) · Zbl 0823.05048
[10] Hwang, F. K.; Lagarias, J. C., Minimum range sequences of all \(k\)-subsets of a set, Discrete Math., 19, 257-264 (1977) · Zbl 0384.05018
[11] Jiang, T.; Mubayi, D.; Shastri, A.; West, D. B., Edge-bandwidth of graphs, SIAM J. Discrete Math., 12, 307-316 (1999) · Zbl 0934.05114
[12] Katona, G. O.H., The Hamming-sphere has minimum boundary, Studia Sci. Math. Hungar., 10, 131-140 (1975) · Zbl 0366.05003
[13] Lai, Y. L.; Williams, K., A survey of solved problems and applications on bandwidth, edge-sum, and profile of graphs, J. Graph Theory, 31, 75-94 (1999) · Zbl 0924.05058
[14] Li, Q.; Tao, M. Q.; Shen, Y. Q., The bandwidth of the discrete tori \(C_m \times C_n\), J. China Univ. Sci. Tech., 11, 1-16 (1981)
[15] Papadimitriou, C. H., The NP-completeness of the bandwidth minimization problem, Computing, 16, 263-270 (1976) · Zbl 0321.65019
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.