✦ LIBER ✦

On majority domination in graphs

✍ Scribed by Tara S. Holm

Book ID: 108315587
Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 106 KB
Volume: 239
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(00)00370-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Majority domination in graphs

✍ Izak Broere; Johannes H. Hattingh; Michael A. Henning; Alice A. McRae 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 538 KB

A two-valued function f defined on the vertices of a graph G =(V, E), f: V ~I-1, 1}, is a majority dominating function if the sum of its function values over at least half the closed neighborhoods is at least one. That is, for at least half the vertices ve V, f (N[v])~ 1, where N [ v ] consists of v

On -total domination in graphs

✍ Michael A. Henning; Nader Jafari Rad 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 244 KB

On restricted domination in graphs

✍ Vladimir Samodivkin 📂 Article 📅 2007 🏛 SP Versita 🌐 English ⚖ 133 KB

On the Signed Domination in Graphs

✍ Jiří Matoušek 📂 Article 📅 2000 🏛 Springer-Verlag 🌐 English ⚖ 144 KB

On weakly connected domination in graphs

✍ Jean E. Dunbar; Jerrold W. Grossman; Johannes H. Hattingh; Stephen T. Hedetniemi 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 497 KB

A weakly connected dominating set for a connected graph is a dominating set D of vertices of the graph such that the edges not incident to any vertex in D do not separate the graph. This paper considers the weakly connected domination number, 7w, and related domination parameters. It is shown that t

On domination in connected cubic graphs

✍ A.V. Kostochka; B.Y. Stodolsky 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 112 KB