Bandwidth of the cartesian product of two connected graphs

Discrete Mathematics

Volumn 252, Issue 1-3, 2002, Pages 227-235

  Kojima, Toru ^a   Ando, Kiyoshi ^a  

^a UNIVERSITY OF ELECTRO COMMUNICATIONS   (Japan)

Author keywords

Bandwidth; Cartesian product; Connectivity; Diameter

Indexed keywords

EID: 33750717271     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(01)00455-1     Document Type: Article

References (11)

1. C. Berge, Graphs and Hypergraphs, North-Holland, Amsterdam, 1973.
2. P.Z. Chinn, J. Chvâtalovâ, A.K. Dewdney, N.E. Gibbs, The bandwidth problem for graphs and matrices-a survey, J. Graph Theory, 6 (1982) 223-254.
3. F.R.K. Chung, Labelings of graphs, in: L.W. Beineke, R.J. Wilson (Eds.), Selected Topics in Graph Theory, Vol. 3, Academic Press, London, 1988, pp. 151-168.
4. V. Chvätal, A remark on a problem of Harary, Czechoslovak Math. J. 20 (1970) 109-111.
5. J. Chvâtalovâ, Optimal labelling of a product of two paths, Discrete Math. 11 (1975) 249-253.
6. J. Chvâtalovâ, A.K. Dewdney, N.E. Gibbs, R.R. Korfhage, The bandwidth problem for graphs: a collection of recent results. Research Report #24, Department of Computer Science, UWO, London, Ontario, 1975.
7. J. Chvâtalovâ, J. Opatmy, The bandwidth of theta graphs, Utilitas Math. 33 (1988) 9-22.
8. M.R. Garey, R.L. Graham, D.S. Johnson, D.E. Knuth, Complexity results for bandwidth minimization, SIAM J. Appl. Math. 34 (1978) 477-495.
9. U. Hendrich, M. Stiebitz, On the bandwidth of graph products, J. Inform. Process. Cybernet. 28 (1992) 113-125.
10. Y.L. Lai, K. Williams, A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs, J. Graph Theory 31 (1999) 75-94.
11. C.H. Papadimitriou, The NP-completeness of the bandwidth minimization problem, Computing 16 (1976) 263-270.