✦ LIBER ✦

Efficient dominating sets in circulant graphs with domination number prime

✍ Scribed by Deng, Yun-Ping

Book ID: 125858457
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 205 KB
Volume: 114
Category: Article
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2014.06.008

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficient domination in circulant graphs

✍ Reji Kumar, K.; MacGillivray, Gary 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 210 KB

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

Subgroups as efficient dominating sets i

Subgroups as efficient dominating sets in Cayley graphs

✍ Tamizh Chelvam, T.; Mutharasu, Sivagnanam 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 198 KB

[Springer Monographs in Mathematics] Tot

[Springer Monographs in Mathematics] Total Domination in Graphs || Graphs with Disjoint Total Dominating Sets

✍ Henning, Michael A.; Yeo, Anders 📂 Article 📅 2013 🏛 Springer New York ⚖ 159 KB

Domination number in graphs with minimum

Domination number in graphs with minimum degree two

✍ Er Fang Shan; Moo Young Sohn; Xu Dong Yuan; Michael A. Henning 📂 Article 📅 2009 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 264 KB

Connected dominating sets in disk graphs

Connected dominating sets in disk graphs with bidirectional links

✍ Thai, M.T.; Du, D.-Z. 📂 Article 📅 2006 🏛 IEEE 🌐 English ⚖ 138 KB