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

@article{Gravier2012NewRO,
  title={New results on variants of covering codes in Sierpiński graphs},
  author={Sylvain Gravier and Matjaz Kovse and Michel Mollard and Julien Moncel and Aline Parreau},
  journal={Designs, Codes and Cryptography},
  year={2012},
  volume={69},
  pages={181-188}
}
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. 

Figures and Topics from this paper.

Explore Further: Topics Discussed in This Paper

Citations

Publications citing this paper.
SHOWING 1-10 OF 13 CITATIONS

On generalized Sierpi?ski graphs

VIEW 1 EXCERPT
CITES BACKGROUND

Structural properties of subdivided-line graphs

  • J. Discrete Algorithms
  • 2015
VIEW 1 EXCERPT
CITES BACKGROUND

References

Publications referenced by this paper.