✦ LIBER ✦

Roman Domination on 2-Connected Graphs

✍ Scribed by Liu, Chun-Hung; Chang, Gerard J.

Book ID: 118197046
Publisher: Society for Industrial and Applied Mathematics
Year: 2012
Tongue: English
Weight: 233 KB
Volume: 26
Category: Article
ISSN: 0895-4801
DOI: 10.1137/080733085

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Note on 2-rainbow domination and Roman d

Note on 2-rainbow domination and Roman domination in graphs

✍ Yunjian Wu; Huaming Xing 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 244 KB

A Roman dominating function of a graph G is a function f : V → {0, 1, 2} such that every vertex with 0 has a neighbor with 2. The minimum of f (V (G)) = v∈V f (v) over all such functions is called the Roman domination number γ R (G). A 2-rainbow dominating function of a graph G is a function g that

Connected domination critical graphs

✍ Xue-Gang Chen; Liang Sun; De-Xiang Ma 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 339 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

Roman domination on strongly chordal gra

Roman domination on strongly chordal graphs

✍ Chun-Hung Liu, Gerard J. Chang 📂 Article 📅 2012 🏛 Springer US 🌐 English ⚖ 500 KB

On connected domination in unit ball gra

On connected domination in unit ball graphs

✍ Sergiy Butenko; Sera Kahruman-Anderoglu; Oleksii Ursulenko 📂 Article 📅 2010 🏛 Springer-Verlag 🌐 English ⚖ 169 KB