✦ LIBER ✦

Dominating sets in social network graphs

✍ Scribed by Laura L. Kelleher; Margaret B. Cozzens

Book ID: 107908771
Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 731 KB
Volume: 16
Category: Article
ISSN: 0165-4896
DOI: 10.1016/0165-4896(88)90041-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Dominating Sets in Planar Graphs

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

Disjoint dominating and total dominating

Disjoint dominating and total dominating sets in graphs

✍ Michael A. Henning; Christian Löwenstein; Dieter Rautenbach; Justin Southey 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 371 KB

New dominating sets in social networks

✍ Xu Zhu; Jieun Yu; Wonjun Lee; Donghyun Kim; Shan Shan; Ding-Zhu Du 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 176 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

Graphs with unique dominating sets

✍ Miranca Fischermann; Lutz Volkmann 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 188 KB

Independent dominating sets in triangle-

Independent dominating sets in triangle-free graphs

✍ Wayne Goddard; Jeremy Lyle 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 439 KB