Laurent Beaudou ; Sylvain Gravier ; Sandi Klavžar ; Matjaz Kovse ; Michel Mollard - Covering codes in Sierpinski graphs

dmtcs:508 - Discrete Mathematics & Theoretical Computer Science, January 1, 2010, Vol. 12 no. 3 - https://doi.org/10.46298/dmtcs.508
Covering codes in Sierpinski graphs

Authors: Laurent Beaudou ; Sylvain Gravier ; Sandi Klavžar ; Matjaz Kovse ; Michel Mollard

    For a graph G and integers a and b, an (a, b)-code of G is a set C of vertices such that any vertex from C has exactly a neighbors in C and any vertex not in C has exactly b neighbors in C. In this paper we classify integers a and b for which there exist (a, b)-codes in Sierpinski graphs.


    Volume: Vol. 12 no. 3
    Section: Graph and Algorithms
    Published on: January 1, 2010
    Imported on: March 26, 2015
    Keywords: codes in graphs,perfect codes,Sierpinski graphs,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]

    1 Document citing this article

    Share

    Consultation statistics

    This page has been seen 254 times.
    This article's PDF has been downloaded 168 times.