✦ LIBER ✦

Line domination in graphs

✍ Scribed by S. R. Jayaram

Book ID: 105309458
Publisher: Springer Japan
Year: 1987
Tongue: English
Weight: 350 KB
Volume: 3
Category: Article
ISSN: 0911-0119
DOI: 10.1007/bf01788558

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Fair domination in graphs

✍ Yair Caro; Adriana Hansberg; Michael Henning 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 253 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

Factor domination in graphs

✍ Robert C. Brigham; Ronald D. Dutton 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 656 KB

Given a factoring of a graph, the factor domination number yr is the smallest number of nodes which dominate all factors. General results, mainly involving bounds on yr for factoring of arbitrary graphs, are presented, and some of these are generalizations of well known relationships. The special c