๐”– Bobbio Scriptorium
โœฆ   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

## 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

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

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