✦ LIBER ✦

Subgroups as efficient dominating sets in Cayley graphs

✍ Scribed by Tamizh Chelvam, T.; Mutharasu, Sivagnanam

Book ID: 120191162
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 198 KB
Volume: 161
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2012.09.005

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficient dominating sets in Cayley grap

Efficient dominating sets in Cayley graphs

✍ 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

Perfect domination sets in Cayley graphs

✍ Kwon, Young Soo; Lee, Jaeun 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 371 KB

Efficient open domination in Cayley grap

Efficient open domination in Cayley graphs

✍ T. Tamizh Chelvam; Sivagnanam Mutharasu 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 230 KB

Independent perfect domination sets in C

Independent perfect domination sets in Cayley graphs

✍ 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

Dominating Sets in Planar Graphs

✍ Lesley R. Matheson; Robert E. Tarjan 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 174 KB

Dominating Sets in Chordal Graphs

✍ Booth, Kellogg S.; Johnson, J. Howard 📂 Article 📅 1982 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 977 KB