A distance-labelling problem for hypercubes

Discrete Applied Mathematics

Volumn 156, Issue 15, 2008, Pages 2846-2854

  Zhou, Sanming ^a  

^a UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

number; Binary code; Channel assignment; Distance colouring; Hypercube; Labelling

Indexed keywords

BINARY CODE; CHANNEL ASSIGNMENT; DISTANCE-COLOURING; HYPER-CUBES; HYPERCUBE; LABELLING;

EID: 53049091908     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2007.11.018     Document Type: Article

References (22)

1. Calamoneri T. The L (h, k)-labelling problem: A survey and annotated bibliography. The Comput. J. (2006)
2. G.J. Chang, C.H. Lu, S. Zhou, Minimum spans of Hamming graphs under distance-two labellings (submitted for publication)
3. 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
4. j-numbers of the products of complete graphs. Congr. Numer. 140 (1999) 141-160
5. 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
6. Griggs J.R., and Yeh R.K. Labelling graphs with a condition at distance two. SIAM J. Discrete Math. 5 (1992) 586-595
7. Hale W.K. Frequency assignment: Theory and applications. Proc. IEEE 68 (1980) 1497-1514
8. van den Heuvel J., Leese R.A., and Shepherd M.A. Graph labeling and radio channel. J. Graph Theory 29 (1998) 263-283
9. Jensen T.R., and Toft B. Graph Coloring Problems (1995), Wiley, New York
10. Kim D.S., Du D.-Z., and Pardalos P.M. A colouring problem on the n-cube. Discrete Appl. Math. 103 (2000) 307-311
11. Kramer F., and Kramer H. A survey on the distance-colouring of graphs. Discrete Math. 308 (2008) 422-426 10.1016/j.disc.2006.11.059
12. Lidl R., and Niederreiter H. Introduction to Finite Fields and Their Applications. revised edition (1994), Cambridge University Press, Cambridge
13. Marǔsic ̌ D. Hamiltonian circuits in Cayley graphs. Discrete Math. 46 (1983) 49-54
14. Ngo H.Q., Du D.-Z., and Graham R.L. New bounds on a hypercube colouring problem. Inform. Proc. Lett. 84 (2002) 265-269
15. Östergård P.R.J. On a hypercube coloring problem. J. Combin. Theory (A) 108 (2004) 199-204
16. Rose J.S. A Course on Group Theory (1978), Cambridge University Press, Cambridge
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. Theoret. Comput. Sci. 310 (2004) 501-511
21. Zhou S. Labelling Cayley graphs on Abelian groups. SIAM J. Discrete Math. 19 (2006) 985-1003
22. Zhou S. Distance labelling problems for hypercubes and Hamming graphs - a survey. Electron. Notes Discrete Math. 28 (2007) 527-534