Bandwidth of the strong product of two connected graphs

Discrete Mathematics

Volumn 308, Issue 7, 2008, Pages 1282-1295

  Kojima, Toru ^a  

^a NIHON UNIVERSITY   (Japan)

Author keywords

Bandwidth; Diameter; Distance; Graph; Strong product

Indexed keywords

BANDWIDTH; NUMERICAL METHODS; PROBLEM SOLVING; SET THEORY;

COMPLETE BIPARTITE GRAPHS; DIAMETERS; STRONG PRODUCTS; VERTICES;

GRAPH THEORY;

EID: 38149112455     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2007.03.074     Document Type: Article

References (9)

1. Chinn P.Z., Chvátalová J., Dewdney A.K., and Gibbs N.E. The bandwidth problem for graphs and matrices-a survey. J. Graph Theory 6 (1982) 223-254
2. Chung F.R.K. Labelings of graphs. In: Beineke L.W., and Wilson R.J. (Eds). Selected Topics in Graph Theory vol. 3 (1988), Academic Press, London 151-168
3. Garey M.R., Graham R.L., Johnson D.S., and Knuth D.E. Complexity results for bandwidth minimization. SIAM J. Appl. Math. 34 (1978) 477-495
4. Hendrich U., and Stiebitz M. On the bandwidth of graph products. J. Inform. Process. Cybernet. EIK 28 (1992) 113-125
5. Kojima T., and Ando K. Bandwidth of the cartesian product of two connected graphs. Discrete Math. 252 (2002) 227-235
6. Lai Y.L., and Williams K. Bandwidth of the strong product of paths and cycles. Congr. Numer. 109 (1995) 123-128
7. Lai Y.L., and Williams K. A survey of solved problems and applications on bandwidth, edgesum. and profile of graphs, J. Graph Theory 31 (1999) 75-94
8. Papadimitriou C.H. The NP-completeness of the bandwidth minimization problem. Computing 16 (1976) 263-270
9. Smithline L. Bandwidth of the complete k-ary tree. Discrete Math. 142 (1995) 203-212