Skip to main content
SpringerLink
Log in

New results on variants of covering codes in Sierpiński graphs

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

In this paper we study identifying codes, locating-dominating codes, and total-dominating codes in Sierpiński graphs. We compute the minimum size of such codes in Sierpiński graphs.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Beaudou L., Gravier S., Klavžar S., Kovše M., Mollard M.: Covering codes in Sierpiński graphs. Discret. Math. Theor. Comput. Sci. 12(3), 63–74 (2010)

    Google Scholar 

  2. Ben-Haim Y., Gravier S., Lobstein A., Moncel J.: Adaptive identification in torii in the king lattice. Electron. J. Comb. 18(1), P116 (2011)

    MathSciNet  Google Scholar 

  3. Ben-Haim Y., Litsyn S.: Exact minimum density of codes identifying vertices in the square grid. SIAM J. Discret. Math. 19(1), 69–82 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  4. Bertrand N., Charon I., Hudry O., Lobstein A.: Identifying and locating-dominating codes on chains and cycles. Eur. J. Comb. 25, 969–987 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  5. Charon I., Cohen G., Hudry O., Lobstein A.: New identifying codes in the binary hamming space. Eur. J. Comb. 31, 491–501 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  6. Charon I., Honkala I., Hudry O., Lobstein A.: The minimum density of an identifying code in the king lattice. Discret. Math. 276(1–3), 95–109 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  7. Chen C., Lua C., Miao Z.: Identifying codes and locating-dominating sets on paths and cycles. Discret. Appl. Math. 159, 1540–1547 (2011)

    Article  MATH  Google Scholar 

  8. Cohen G., Honkala I., Litsyn S., Lobstein A.: Covering Codes. Elsevier, Amsterdam (1997)

    MATH  Google Scholar 

  9. Cull P., Nelson I.: Error-correcting codes on the Towers of Hanoi graphs. Discret. Math. 208(209), 157–175 (1999)

    Article  MathSciNet  Google Scholar 

  10. Exoo G., Junnila V., Laihonen T., Ranto S.: Improved bounds on identifying codes in binary Hamming spaces. Eur. J. Comb. 31, 813–827 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  11. Foucaud F., Klasing R., Kosowski A., Raspaud A.: Bounds on the size of identifying codes in triangle-free graphs. (2010) (submitted for publication).

  12. Gravier S., Klavžar S., Mollard M.: Codes and L(2, 1)-labelings in Sierpiński graphs. Taiwan. J. Math. 9, 671–681 (2005)

    MATH  Google Scholar 

  13. Gravier S., Kovše M., Parreau A.: Generalized Sierpiński graphs. (in preparation).

  14. Gravier S., Moncel J., Semri A.: Identifying codes of cartesian product of two cliques of the same size. Electron. J. Comb. 15(1), N4 (2008)

    MathSciNet  Google Scholar 

  15. Gravier S., Moncel J., Semri A.: Identifying codes of cycles. Eur. J. Comb. 27(5), 767–776 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  16. Hinz A., Klavžar S., Milutinović U., Petr C.: The Tower of Hanoi: Myths and Maths (to appear).

  17. Honkala I., Laihonen T.: On identifying codes in the king grid that are robust against edge deletions. Electron. J. Comb. 15(1), R3 (2008)

    MathSciNet  Google Scholar 

  18. Jakovac M.: A 2-parametric generalization of Sierpiński gasket graphs. Ars Comb. (to appear).

  19. Junnila V., Laihonen T.: Optimal identifying codes in cycles and paths. Graphs Comb. doi:10.1007/s00373-011-1058-6.

  20. Klavžar S.: Coloring Sierpiński graphs and Sierpiński gasket graphs. Taiwan. J. Math. 12, 513–522 (2008)

    MATH  Google Scholar 

  21. Klavžar S., Jakovac M.: Vertex-, edge-, and total-colorings of Sierpiński-like graphs. Discret. Math. 309, 1548–1556 (2009)

    Article  MATH  Google Scholar 

  22. Klavžar S., Milutinović U.: Graphs S(n, k) and a variant of the Tower of Hanoi problem. Czechoslov. Math. J. 47(122), 95–104 (1997)

    Article  MATH  Google Scholar 

  23. Klavžar S., Milutinović U., Petr C.: 1-perfect codes in Sierpiński graphs. Bull. Aust. Math. Soc. 66, 369–384 (2002)

    Article  MATH  Google Scholar 

  24. Klavžar S., Mohar B.: Crossing numbers of Sierpiński-like graphs. J. Graph Theory 50, 186–198 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  25. Li C.-K., Nelson I.: Perfect codes on the Towers of Hanoi graphs. Bull. Aust. Math. Soc. 57, 367–376 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  26. Lipscomb S.L., Perry J.C.: Lipscomb’s L(A) space fractalized in Hilbert’s l 2(A) space. Proc. Am. Math. Soc. 115, 1157–1165 (1992)

    MathSciNet  MATH  Google Scholar 

  27. Lipscomb S.L.: Fractals and Universal Spaces in Dimension Theory. Springer, Berlin (2009)

    Book  MATH  Google Scholar 

  28. Lobstein A.: Watching systems, identifying, locating-dominating and discriminating codes in graphs, a bibliography. Published electronically at http://perso.enst.fr/~lobstein/debutBIBidetlocdom.pdf. Accessed 12 March 2012.

  29. Milutinović U.: Completeness of the Lipscomb space. Glas. Mat. Ser. III 27(47), 343–364 (1992)

    MathSciNet  MATH  Google Scholar 

  30. Mollard M.: On perfect codes in Cartesian product of graphs. Eur. J. Comb. 32(3), 398–403 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  31. Moncel J.: Monotonicity of the minimum cardinality of an identifying code in the hypercube. Discret. Appl. Math. 154(6), 898–899 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  32. Roberts D.L., Roberts F.S.: Locating sensors in paths and cycles: the case of 2-identifying codes. Eur. J. Comb. 29(1), 72–82 (2008)

    Article  MATH  Google Scholar 

  33. Teguia A.M., Godbole A.P.: Sierpiński gasket graphs and some of their properties. Aust. J. Comb. 35, 181–192 (2006)

    MathSciNet  MATH  Google Scholar 

  34. Xu M., Thulasiraman K., Hu X.-D.: Identifying codes of cycles with odd orders. Eur. J. Comb. 29(7), 1717–1720 (2008)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fédération de recherche Maths à Modeler, Grenoble, France

    Sylvain Gravier, Michel Mollard, Julien Moncel & Aline Parreau

  2. Institut Fourier – UMR 5582 CNRS/Université Joseph Fourier, 100 rue des maths, BP 74, 38402, St. Martin d’Hères, France

    Sylvain Gravier, Michel Mollard & Aline Parreau

  3. Faculty of Natural Sciences and Mathematics, University of Maribor, Koroška 160, 2000, Maribor, Slovenia

    Matjaž Kovše

  4. Institute of Mathematics, Physics and Mechanics, Ljubljana, Slovenia

    Matjaž Kovše

  5. CNRS – LAAS Université de Toulouse, UPS, INSA, INP, ISAE; UT1, UTM, LAAS, 7 avenue du Colonel Roche, 31077, Toulouse Cedex 4, France

    Julien Moncel

Authors
  1. Sylvain Gravier
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Matjaž Kovše
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Michel Mollard
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Julien Moncel
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Aline Parreau
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Julien Moncel.

Additional information

Communicated by W. H. Haemers.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gravier, S., Kovše, M., Mollard, M. et al. New results on variants of covering codes in Sierpiński graphs. Des. Codes Cryptogr. 69, 181–188 (2013). https://doi.org/10.1007/s10623-012-9642-1

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-012-9642-1

Keywords

Mathematics Subject Classification (2000)

Search

Navigation