Covering codes in Sierpinski graphs
Author:
Beaudou Laurent,Gravier Sylvain,Klavžar Sandi,Kovse Matjaz,Mollard Michel
Abstract
Graphs and Algorithms
International audience
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.
Publisher
Centre pour la Communication Scientifique Directe (CCSD)
Subject
Discrete Mathematics and Combinatorics,General Computer Science,Theoretical Computer Science
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献