Codes and L(2,1)-labelings in sierpiński graphs

Taiwanese Journal of Mathematics

Volumn 9, Issue 4, 2005, Pages 671-681

  Gravier, Sylvain ^a   Klavžar, Sandi ^b   Mollard, Michel ^a  

^a CNRS   (France)

^b UNIVERSITY OF MARIBOR   (Slovenia)

Author keywords

Codes in graphs; L(2, 1) labelings; Perfect codes; Sierpi ski graphs; number

Indexed keywords

EID: 27844463165     PISSN: 10275487     EISSN: 10275487     Source Type: Journal    
DOI: 10.11650/twjm/1500407890     Document Type: Article

References (23)

1. N. Biggs, Perfect codes in graphs, J. Combin. Theory Ser. B, 15 (1973), 289-296.
2. G. J. Chang and D. Kuo, The L(2,1)-labeling on graphs, SIAM J. Discrete Math., 9 (1996), 309-316.
3. G. J. Chang and S.-C. Liaw, The L(2, 1)-labeling problem on ditrees, Ars Combin., 66 (2003), 23-31.
4. G. J. Chang and C. Lu, Distance-two labelings of graphs, European J. Combin., 24 (2003), 53-58.
5. P. Cull and I. Nelson, Error-correcting codes on the Towers of Hanoi graphs, Discrete Math., 208/209 (1999), 157-175.
6. J. Fiala, T. Kloks and J. Kratochvil, Fixed-parameter complexity of λ-labelings, Discrete Appl. Math., 113 (2001), 59-72.
7. 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 (2001), 28-35.
8. J. R. Griggs and R. K. Yeh, Labelling graphs with a condition at distance two, SIAM J. Discrete Math., 5 (1992), 586-595.
9. W. K. Hale, Frequency assignment: Theory and application, Proc. IEEE, 68 (1980), 1497-1514.
10. S. T. Hedetniemi, A. A. McRae and D. A. Parks, Complexity results. (In: T. W. Haynes, S. T. Hedetniemi, and P. J. Slater, Domination in Graphs: Advanced Topics, Marcel Dekker, New York, 1998.) Chapter 9, 233-269.
11. J. Van den Heuvel, R. A. Leese and M. A. Shepherd, Graph labeling and radio channel assignment, J. Graph Theory, 29 (1998), 263-283.
12. P. K. Jha, A. Narayanan, P. Sood, K. Sundaram and V. Sunder, On L(2, 1)-labeling of the Cartesian product of a cycle and a path, Ars Combin., 55 (2000), 81-89.
13. S. Klavžar and U. Milutinović", Graphs 5(n, k) and a variant of the Tower of Hanoi problem, Czechoslovak Math. J., 47(122) (1997), 95-104.
14. S. Klavžar, U. Milutinović and C. Petr, 1-perfect codes in Sierpiński graphs, Bull. Austral. Math. Soc., 66 (2002), 369-384.
15. S. Klavžar and B. Mohar, Crossing numbers of Sierpiński-like graphs, submitted.
16. S. Klavžar and A. Vesel, Computing graph invariants on rotagraphs using dynamic algorithm approach: the case of (2,1)-colorings and independence numbers, Discrete Appl. Math., 129 (2003), 449-460.
17. J. Kratochvíl, Perfect Codes in General Graphs, Rozpravy Ceskoslovenské Akad., Ved Rada Mat. Prírod. Ved, no. 7, Akademia Praha, 1991, p. 126.
18. C.-K. Li and I. Nelson, Perfect codes on the Towers of Hanoi graphs, Bull. Austral. Math. Soc., 57 (1998), 367-376.
19. 2(A) space, Proc. Amer. Math. Soc., 115 (1992), 1157-1165.
20. D. Liu and R. K. Yeh, On distance-two labelings of graphs, Ars Combin., 47 (1997), 13-22.
21. U. Milutinović, Completeness of the Lipscomb space, Glas. Mat. Ser III, 27(47) (1992), 343-364.
22. D. Sakai, Labeling chordal graphs: Distance-two condition, SIAM J. Discrete Math., 1 (1994), 133-140.
23. n and related graphs, SIAM J. Discrete Math., 8 (1995), 499-506.