✦ LIBER ✦

Fair domination in graphs

✍ Scribed by Yair Caro; Adriana Hansberg; Michael Henning

Book ID: 113567694
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 253 KB
Volume: 312
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2012.05.006

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Reviewing some Results on Fair Dominatio

Reviewing some Results on Fair Domination in Graphs

✍ Hansberg, Adriana 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 178 KB

Generalized domination and efficient dom

Generalized domination and efficient domination in graphs

✍ D.W. Bange; A.E. Barkauskas; L.H. Host; P.J. Slater 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 516 KB

This paper generalizes dominating and efficient dominating sets of a graph. Let G be a graph with vertex set V(G). If f: V(G) ~ Y, where Y is a subset of the reals, the weight off is the sum of f(v) over all ve V(G). If the closed neighborhood sum off(v) at every vertex is at least 1, thenfis called

Domination versus independent domination

Domination versus independent domination in cubic graphs

✍ Southey, Justin; Henning, Michael A. 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 433 KB

Line domination in graphs

✍ S. R. Jayaram 📂 Article 📅 1987 🏛 Springer Japan 🌐 English ⚖ 350 KB

Minus domination in graphs

✍ Jean Dunbar; Stephen Hedetniemi; Michael A. Henning; Alice McRae 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 787 KB

Domination in permutation graphs

✍ Martin Farber; J Mark Keil 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 617 KB