Authors: Laurent Beaudou ¹; Sylvain Gravier ^2,3; Sandi Klavžar ^4,5,6; Matjaz Kovse ^2,6; Michel Mollard ²

• 1 Laboratoire Bordelais de Recherche en Informatique [LaBRI]
• 2 Institut Fourier
• 3 Laboratoire Leibniz
• 4 Faculty of Mathematics and Physics [Ljubljana]
• 5 Faculty of Natural Sciences and Mathematics [Maribor]
• 6 Institute of Mathematics, Physics and Mechanics [Ljubljana]

Graphs and Algorithms

[en]
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.