On bandwidth for the tensor product of paths and cycles

Discrete Applied Mathematics

Volumn 73, Issue 2, 1997, Pages 133-141

  Lai, Yung Ling ^a   Williams, Kenneth ^a  

^a Parkview Campus   (United States)

Author keywords

Bandwidth; Graph; Optimal numbering; Tensor product

Indexed keywords

EID: 0040094247     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0166-218x(95)00005-c     Document Type: Article

References (13)

1. M. Capobianco and J.C. Molluzzo, Examples and counterexamples in Graph Theory (Elsevier, North-Holland, 1978).
2. P.Z. Chinn, J. Chvátalová, A.K. Dewdney and N.E. Gibbs, The bandwidth problem for graphs and matrices - a survey, J. Graph Theory 6 (1982) 223-254.
3. P.Z. Chinn, Y. Lin and J. Yuan, The bandwidth of the corona of two graphs, Congress. Numer. 91 (1992) 141-152.
4. P.Z. Chinn, Y. Lin, J. Yuan and K. Williams, Bandwidth of the composition of certain graph powers, Ars Combin. 39(1994) 167-173.
5. V. Chvátal, A remark on a problem of Harary, Czechoslovak Math. J. 20 (1970) 109-111.
6. J. Chvátalová, Optimal labelling of a product of two graphs, Discrete Math. 11 (1975) 249-253.
7. J. Chvátalová, A.K. Dewdney, N.E. Gibbs and R.R. Korfhage, The bandwidth problem for graphs: a collection of recent results, Research Report #24, Department of Computer Sciencce, UWO, London, Ontario (1975).
8. M.R. Garey, R.L. Graham, D.S. Johnson and D.E. Knuth, Complexity results for bandwidth minimization, SIAM J. Appl. Math. (1978) 477-495, MR57#18220.
9. L.H. Harper, Optimal numberings and isoperimetric problems on graphs, J. Combin. Theory 1 (1966), 385-393, MR34#91.
10. Y.L. Lai, J. Liu and K. Williams, Bandwidth for the sum of k graphs, Ars Combin., 37(1994) 149-155.
11. D.J. Miller, The categorical product of graphs. Can. J. Math. 20 (1968) 1511-1521.
12. C.H. Papadimitriou, The NP-completeness of the bandwidth minimization problem, Computing 16 (1976) 263-270, MR53#14981.
13. P.M. Weichsel, The kronecker product of graphs, Proc. Amer. Math. Soc. 13 (1962) 47-52.