Distance Labelling Problems for Hypercubes and Hamming Graphs - A Survey

Electronic Notes in Discrete Mathematics

Volumn 28, Issue , 2007, Pages 527-534

  Zhou, Sanming ^a  

^a UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

number; channel assignment; cyclic L(j, k) labelling; Hamming graph; hypercube; L(j, k) labelling; no hole L(j, k) labelling

Indexed keywords

EID: 33847336970     PISSN: 15710653     EISSN: 15710653     Source Type: Journal    
DOI: 10.1016/j.endm.2007.01.073     Document Type: Article

References (22)

1. Calamoneri T. The L(h, k)-labelling problem: a survey and annotated bibliography. The Computer Journal (2006)
2. Chang, G.J., C.H. Lu and S. Zhou, Minimum spans of Hamming graphs under distance-two labellings, submitted
3. Chang, G.J., C.H. Lu and S. Zhou, No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups, Discrete Math., to appear
4. Erwin D.J., Georges J.P., and Mauro D.W. On labelling the vertices of products of complete graphs with distance constraints. J. Naval Res. and Logist. 52 (2005) 138-141
5. j-numbers of the products of complete graphs. Congr. Numer. 140 (1999) 141-160
6. Georges J.P., Mauro D.W., and Stein M.I. Labelling products of complete graphs with a condition at distance two. SIAM J. Discrete Math. 14 (2000) 28-35
7. Griggs J.R., and Yeh R.K. Labelling graphs with a condition at distance two. SIAM J. Discrete Math. 5 (1992) 586-595
8. Hale W.K. Frequency assignment: theory and applications. Proc. IEEE 68 (1980) 1497-1514
9. van den Heuvel J., Leese R.A., and Shepherd M.A. Graph labeling and radio channel. J. Graph Theory 29 (1998) 263-283
10. Jensen T.R., and Toft B. Graph Coloring Problems (1995), Wiley, New York
11. Kim D.S., Du D.-Z., and Pardalos P.M. A colouring problem on the n-cube. Discrete Applied Math. 103 (2000) 307-311
12. Li, X.W., V. Mak and S. Zhou, L(2, 1)-labellings of cubic Cayley graphs on dihedral groups (tentative title), in preparation
13. Liu D.D.-F. Hamiltonicity and circular distance two labellings. Discrete Math. 232 (2001) 163-169
14. Marǔsič D. Hamiltonian circuits in Cayley graphs. Discrete Math. 46 (1983) 49-54
15. Ngo H.Q., Du D.-Z., and Graham R.L. New bounds on a hypercube colouing problem. Information Processing Letters 84 (2002) 265-269
16. Östergård P.R.J. On a hypercube coloring problem. J. Combin. Theory (A) 108 (2004) 199-204
17. Wan P.-J. Near-optimal conflict-free channel set assignments for an optical cluster-based hypercube network. J. Combin. Optim. 1 (1997) 179-186
18. n and related graphs. SIAM J. Discrete Math. 8 (1995) 499-506
19. Ziegler G.M. Coloring Hamming graphs, optimal binary codes, and the 0/1-Borsuk problem in low dimensions. In: Alt H. (Ed). Computational Discrete Mathematics (2001), Springer, Berlin 159-171
20. Zhou S. A channel assignment problem for optical networks modelled by Cayley graphs. Theoretical Computer Science 310 (2004) 501-511
21. Zhou S. Labelling Cayley graphs on Abelian groups. SIAM J. Discrete Math. 19 (2006) 985-1003
22. Zhou, S., A distance labelling problem on hypercubes, submitted