1-perfect codes in Sierpiński graphs

Bulletin of the Australian Mathematical Society

Volumn 66, Issue 3, 2002, Pages 369-384

  Klavžar, Sandi ^a   Milutinovič, Uroš ^a   Petr, Ciril ^b  

^a UNIVERSITY OF MARIBOR   (Slovenia)

^b Iskratel Telecommunications Systems Ltd   (Slovenia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036921879     PISSN: 00049727     EISSN: None     Source Type: Journal    
DOI: 10.1017/s0004972700040235     Document Type: Article

References (24)

1. D.W. Bange, A.E. Barkauskas and P.J. Slater, 'Efficient dominating sets in graphs', in Applications of Discrete Mathematics, Clemson, 1986 (SIAM, Philadelphia, 1988), pp. 189-199.
2. D.W. Bange, A.E. Barkauskas and L.H. Clark, 'The number of orientations of a tree admitting an efficient dominating set', Ars Combin. 45 (1997), 201-207.
3. E. Bannai, 'Codes in bipartite distance-regular graphs', J. London Math. Soc. 16 (1977), 197-202.
4. N. Biggs, 'Perfect codes in graphs', J. Combin. Theory Ser. B 15 (1973), 289-296.
5. P. Cull and I. Nelson, 'Error-correcting codes on the Towers of Hanoi graphs', Discrete Math. 208/209 (1999), 157-175.
6. P. Cull and I. Nelson, 'Perfect codes, NP-completeness, and Towers of Hanoi graphs', Bull. Inst. Combin. Appl. 26 (1999), 13-38.
7. M.R. Fellows and M.N. Hoover, 'Perfect domination', Australas. J. Combin. 3 (1991), 141-150.
8. P. Hammond, 'On the nonexistence of perfect and nearly perfect codes', Discrete Math. 39 (1982), 105-109.
9. T.W. Haynes, S.T. Hedetniemi and P.J. Slater, Fundamentals of domination in graphs (Marcel Dekker, New York, 1998).
10. S.T. Hedetniemi, A.A. McRae and D.A. Parks, 'Complexity results', in Domination in Graphs: Advanced Topics, (T.W. Haynes, S.T. Hedetniemi and P.J. Slater, Editors) (Marcel Dekker, New York, 1998), pp. 233-269.
11. S. Klavžar and U. Milutinović, 'Graphs S(n, k) and a variant of the Tower of Hanoi problem', Czechoslovak Math. J. 47 (1997), 95-104.
12. W.F. Klostermeyer and E.M. Eschen, 'Perfect codes and independent dominating sets', Congr. Numer. 142 (2000), 7-28.
13. J. Kratochvíl, 'Perfect codes over graphs', J. Combin. Theory Ser. B 40 (1986), 224-228.
14. J. Kratochvíl, 'Perfect codes and two-graphs', Comment. Math. Univ. Carolin. 30 (1989), 755-760.
15. J. Kratochvíl, Perfect codes in general graphs, Rozpravy Československé Akad. Věd Řada Mat. Přírod Věd 7 (Akademia, Praha, 1991).
16. J. Kratochvíl, 'Regular codes in regular graphs are difficult', Discrete Math. 133 (1994), 191-205.
17. J. Kratochvíl and M. Křivánek, 'On the computational complexity of codes in graphs', in Mathematical Foundations of Computer Science, Carlsbad, 1988, Lecture Notes in Comput. Sci. 324 (Springer-Verlag, Berlin, 1988), pp. 396-404.
18. J. Kratochvíl, J. Malý and J. Matoušek, 'On the existence of perfect codes in a random graph', in Random Graphs, (M. Karoński, Jerzy Jaworski and Andrzej Ruciński, Editors) (J. Wiley and Sons, Chichester, 1990), pp. 141-149.
19. J. Kratochvíl, P. Manuel and M. Miller, 'Generalized domination in chordal graphs', Nordic J. Comput. 2 (1995), 41-50.
20. C.-K. Li and I. Nelson, 'Perfect codes on the Towers of Hanoi graphs', Bull. Austral. Math. Soc. 57 (1998), 367-376.
21. 2(A) space', Proc. Amer. Math. Soc. 115 (1992), 1157-1165.
22. U. Milutinović, 'Completeness of the Lipscomb space', Glas. Mat. Ser. III 27(47) (1992), 343-364.
23. C.B. Smart and P.J. Slater, 'Complexity results for closed neighborhood order parameters', Congr. Numer. 112 (1995), 83-96.
24. k)', Glasgow Math. J. 21 (1980), 169-172.