Labelling cayley graphs on abelian groups

SIAM Journal on Discrete Mathematics

Volumn 19, Issue 4, 2005, Pages 985-1003

  Zhou, Sanming ^a  

^a UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

number; j,k number; Cayley graph; Channel assignment; Hamming graph; Hypercube; L(j, k) labelling; Radio chromatic number

Indexed keywords

INTEGER PROGRAMMING; MATHEMATICAL MODELS; MATRIX ALGEBRA; NUMBER THEORY; NUMERICAL METHODS;

Λ-NUMBER; ΛJ,K-NUMBER; CAYLEY GRAPH; CHANNEL ASSIGNMENT; HAMMING GRAPH; HYPERCUBE; L(J, K)-LABELLING; RADIO CHROMATIC NUMBER;

GRAPH THEORY;

EID: 33751174518     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480102404458     Document Type: Article

References (30)

1. N. L. BIGGS, Algebraic graph theory (2nd edition), Cambridge University Press, Cambridge, UK, 1993.
2. G. J. CHANG, W-T. KE, D. KUO, D. D-F. LIU, AND R. K. YEH, On L(d, 1)-labelings of graphs, Discrete Math., 220 (2000), pp. 57-66.
3. G. J. CHANG AND D. KUO, The L(2, 1)-labeling problem on graphs, SIAM J. Discrete Math., 9 (1996), pp. 309-316.
4. G. J. CHANG AND C. LU, Distance-two labelings of graphs, European J. Combin., 24 (2003), pp. 53-58.
5. G. J. CHANG, C. LU, AND S. ZHOU, Minimum spans of Hamming graphs under distance-two labelling, in preparation.
6. D. J. ERWIN, J. P. GEORGES, AND D. W. MAURO, On labeling the vertices of products of complete graphs with distance constraints, Naval Res. Logist., 52 (2005), pp. 138-141.
7. J. P. GEORGES AND D. W. MAURO, Generalized vertex labelings with a condition at distance two, Congr. Numer., 109 (1995), pp. 141-159.
8. j-numbers of the products of complete graphs, Congr. Numer., 140 (1999), pp. 141-160.
9. J. P. GEORGES, D. W. MAURO, AND M. I. STEIN, Labeling products of complete graphs with a condition at distance two, SIAM J. Discrete Math., 14 (2000), pp. 28-35.
10. J. P. GEORGES, D. W. MAURO, AND M. A. WHITTLESEY, Relating path coverings to vertex labellings with a condition at distance two, Discrete Math., 135 (1994), pp. 103-111.
11. J. R. GRIGGS AND R. K. YEH, Labelling graphs with a condition at distance two, SIAM J. Discrete Math., 5 (1992), pp. 586-595.
12. J. L. GROSS, Every connected regular graph of even degree is a Schreier coset graph, J. Combinatorial Theory Ser. B, 22 (1977), pp. 227-232.
13. W. K. HALE, Frequency assignment: Theory and applications, Proc. IEEE, 68 (1080), pp. 1497-1514.
14. F. HARARY, Coloring costs of a graph and the radio coloring number, private communication.
15. F. HARARY AND M. PLANTHOLT, Graphs whose radio coloring number equals the number of nodes, in Graph colouring and Applications (Montréal, QC, 1997), CRM Proc. Lecture Notes 23, AMS, Providence, RI, 1999, pp. 99-100.
16. W. IMRICH, Graphs with transitive abelian automorphism group, in Combin. Theory Appl., Vol. 4, Colloq. Math. Soc. János Bolyai, North-Holland, Amsterdam, 1970, pp. 651-656.
17. W. IMRICH AND S. KLAVŽAR, Product Graphs, Wiley-Interscience, New York, 2000.
18. W. IMRICH AND M. E. WATKINS, On automorphism groups of Cayley graphs, Period. Math. Hungar., 7 (1976), pp. 243-258.
19. K. JONAS, Graph coloring analogues with a condition at distance two: L(2, 1)-labellings and listed λ-labellings, Ph.D. thesis, Department of Mathematics, University of South Carolina, Columbia, SC, 1993.
20. D. KRÁL AND R. SKREKOVSKI, A theorem about the channel assignment problem, SIAM J. Discrete Math., 16 (2003), pp. 426-437.
21. D. MARǓSIČ, Hamiltonian circuits in Cayley graphs, Discrete Math., 46 (1983), pp. 49-54.
22. F. S. ROBERTS, T-colorings of graphs: Recent results and open problems, Discrete Math., 93 (1991), pp. 229-245.
23. F. S. ROBERTS, No-hole 2-distant colorings, in Graph-theoretic Models in Computer Science II (Las Cruces, NM, 1988-1990), Math. Comput. Modelling, 17 (1993), pp. 139-144.
24. D. SAKAI, Labelling chordal graphs: Distance two condition, SIAM J. Discrete Math., 7 (1994), pp. 133-140.
25. J. S. ROSE, A Course on Group Theory, Cambridge University Press, Cambridge, UK, 1978.
26. A. W. TO, personal communication, 2003.
27. T. WALSH, The cost of radio-colouring paths and cycles, in Graph Colouring and Applications (Montréal, QC, 1997), CRM Proc. Lecture Notes 23, AMS, Providence, RI, 1999, pp. 131-133.
28. P.-J. WAN, Near-optimal conflict-free channel set assignments for an optical cluster-based hypercube network, J. Comb. Optim., 1 (1997), pp. 179-186.
29. n and related graphs, SIAM J. Discrete Math., 8 (1995), pp. 499-506.
30. R. K. YEH, Labelling graphs with a condition at distance two, Ph.D. thesis, Department of Mathematics, University of South Carolina, Columbia, SC, 1990.