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.
https://hal.inria.fr/hal-00990423
Contributeur : Service Ist Inria Sophia Antipolis-Méditerranée / I3s
<>
Soumis le : mardi 13 mai 2014 - 15:36:11
Dernière modification le : lundi 14 mai 2018 - 09:50:03
Document(s) archivé(s) le : lundi 10 avril 2017 - 22:20:49
