Back to Search
Start Over
Covering codes in Sierpiński graphs.
- Source :
-
Discrete Mathematics & Theoretical Computer Science (DMTCS) . Jun2010, Vol. 12 Issue 3, p63-74. 12p. 3 Diagrams. - Publication Year :
- 2010
-
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 Sierpiński graphs. [ABSTRACT FROM AUTHOR]
- Subjects :
- *GRAPH theory
*COMBINATORICS
*GRAPHIC methods
*CODING theory
*MATHEMATICS
Subjects
Details
- Language :
- English
- ISSN :
- 13658050
- Volume :
- 12
- Issue :
- 3
- Database :
- Academic Search Index
- Journal :
- Discrete Mathematics & Theoretical Computer Science (DMTCS)
- Publication Type :
- Academic Journal
- Accession number :
- 60988999