𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Disjoint dominating and total dominating sets in graphs

✍ Scribed by Michael A. Henning; Christian Löwenstein; Dieter Rautenbach; Justin Southey

Book ID
108112887
Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
371 KB
Volume
158
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Dominating Sets in Planar Graphs
Dominating Sets in Planar Graphs
✍ Lesley R. Matheson; Robert E. Tarjan 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 174 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