Skip to Main content Skip to Navigation
Journal articles

Covering codes in Sierpinski graphs

Abstract : 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.
Document type :
Journal articles
Complete list of metadata

Cited literature [19 references]  Display  Hide  Download

https://hal.inria.fr/hal-00990423
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Submitted on : Tuesday, May 13, 2014 - 3:36:11 PM
Last modification on : Tuesday, May 11, 2021 - 11:36:03 AM
Long-term archiving on: : Monday, April 10, 2017 - 10:20:49 PM

File

1283-5544-1-PB.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00990423, version 1

Collections

Citation

Laurent Beaudou, Sylvain Gravier, Sandi Klavžar, Matjaz Kovse, Michel Mollard. Covering codes in Sierpinski graphs. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2010, 12 (3), pp.63-74. ⟨hal-00990423⟩

Share

Metrics

Record views

343

Files downloads

959