✦ LIBER ✦

Strong weak domination and domination balance in a graph

✍ Scribed by E. Sampathkumar; L.Pushpa Latha

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 365 KB
Volume: 161
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(95)00231-k

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On domination and independent domination

On domination and independent domination numbers of a graph

✍ Robert B. Allan; Renu Laskar 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 399 KB

For a graph G, the definitions of doknation number, denoted y(G), and independent domination number, denoted i(G), are given, and the following results are obtained: oorollrrg 1. For any graph G, y(L(G)) = i@(G)), where Z,(G) is the line graph of G. (This $xh!s t.lic rtsult ~(L(T))~i(L(T)), h w ere

Least domination in a graph

✍ Odile Favaron 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 357 KB

The least domination number 7L of a graph G is the minimum cardinality of a dominating set of G whose domination number is minimum. The least point covering number ~L of G is the minimum cardinality of a total point cover (point cover including every isolated vertex of G) whose total point covering

Stability, domination and irredundance i

Stability, domination and irredundance in a graph

✍ Odile Favaron 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 441 KB

In a graph G, a set X is called a stable set if any two vertices of X are nonadjacent. A set X is called a dominating set if every vertex of V-X is joined to at least one vertex of X. A set Xis called an irredundant set if every vertex of X, not isolated in X, has at least one proper neighbor, that

Domination and irredundance in the queen

Domination and irredundance in the queens' graph

✍ A.P Burger; E.J Cockayne; C.M Mynhardt 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 1020 KB

The vertices of the queem;' graph {~, are the squares of an n × n chessboard and two squares are adjacent ifa queen placed on one covers the other. It is shown that the domination num;~'r of Q. is at most 31n/54 + O(1), that Q. possesses minimal dominating sets of cardina~tty 5n/2 -O(l) and that the

Domination in a graph with a 2-factor

✍ Ken-ichi Kawarabayashi; Michael D. Plummer; Akira Saito 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 77 KB

## Abstract Let γ(__G__) be the domination number of a graph __G__. Reed 6 proved that every graph __G__ of minimum degree at least three satisfies γ(__G__) ≤ (3/8)|__G__|, and conjectured that a better upper bound can be obtained for cubic graphs. In this paper, we prove that a 2‐edge‐connected cu

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