| HAL-Inria | Publications, software ... of Inria's scientists |
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.
Cited literature [19 references]
https://hal.inria.fr/hal-00990423
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s Connect in order to contact the contributor
Submitted on : Tuesday, May 13, 2014 - 3:36:11 PM
Last modification on : Saturday, June 25, 2022 - 10:34:46 AM
Long-term archiving on: : Monday, April 10, 2017 - 10:20:49 PM
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s Connect in order to contact the contributor
Submitted on : Tuesday, May 13, 2014 - 3:36:11 PM
Last modification on : Saturday, June 25, 2022 - 10:34:46 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)