## Abstract In this paper, we show that a Cayley graph for an abelian group has an independent perfect domination set if and only if it is a covering graph of a complete graph. As an application, we show that the hypercube __Q~n~__ has an independent perfect domination set if and only if __Q~n~__ i
โฆ LIBER โฆ
Perfect domination sets in Cayley graphs
โ Scribed by Kwon, Young Soo; Lee, Jaeun
- Book ID
- 122436401
- Publisher
- Elsevier Science
- Year
- 2014
- Tongue
- English
- Weight
- 371 KB
- Volume
- 162
- Category
- Article
- ISSN
- 0166-218X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Independent perfect domination sets in C
โ
Jaeun Lee
๐
Article
๐
2001
๐
John Wiley and Sons
๐
English
โ 92 KB
๐ 1 views
Efficient dominating sets in Cayley grap
โ
Italo J. Dejter; Oriol Serra
๐
Article
๐
2003
๐
Elsevier Science
๐
English
โ 506 KB
An independent set C of vertices in a graph is an e cient dominating set (or perfect code) when each vertex not in C is adjacent to exactly one vertex in C. An E-chain is a countable family of nested graphs, each of which has an e cient dominating set. The Hamming codes in the n-cubes provide a clas
Subgroups as efficient dominating sets i
โ
Tamizh Chelvam, T.; Mutharasu, Sivagnanam
๐
Article
๐
2013
๐
Elsevier Science
๐
English
โ 198 KB
Efficient open domination in Cayley grap
โ
T. Tamizh Chelvam; Sivagnanam Mutharasu
๐
Article
๐
2012
๐
Elsevier Science
๐
English
โ 230 KB
On Perfect Cayley Graphs
โ
Agnes V. Dizon-Garciano; Ian June L. Garces; Mari-Jo P. Ruiz
๐
Article
๐
2002
๐
Elsevier Science
๐
English
โ 460 KB
Generalized perfect domination in graphs
โ
B. Chaluvaraju, K. A. Vidya
๐
Article
๐
2012
๐
Springer US
๐
English
โ 458 KB