✦ LIBER ✦

On graphs whose domination numbers equal their independent domination numbers

✍ Scribed by Belmannu Devadas Acharya; Purnima Gupta

Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 185 KB
Volume: 15
Category: Article
ISSN: 1571-0653
DOI: 10.1016/s1571-0653(04)00505-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On graphs with equal domination and inde

On graphs with equal domination and independent domination numbers

✍ Jerzy Topp; Lutz Volkmann 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 284 KB

Topp, J. and L. Volkmann, On graphs wi',h equal domination and independent domination number, Discrete Mathematics 96 (1991) 75-80. Allan and Laskar have shown that Kt.s-free graphs are graphs with equal domination and independent domination numbers. In this paper new classes of graphs with equal d

Domination critical graphs with higher i

Domination critical graphs with higher independent domination numbers

✍ Ao, S.; Cockayne, E.J.; MacGillivray, G.; Mynhardt, C.M. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 348 KB 👁 2 views

We show that for each k L 4 there exists a connected k-domination critical graph with independent domination number exceeding k, thus disproving a conjecture of Sumner and Blitch ( J Cornbinatorial Theory B 34 (19831, 65-76) in all cases except k = 3.

On graphs with equal domination and cove

On graphs with equal domination and covering numbers

✍ Lutz Volkmann 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 505 KB

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

Graphs whose choice number is equal to t

Graphs whose choice number is equal to their chromatic number

✍ Gravier, Sylvain; Maffray, Fr�d�ric 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 219 KB

A graph G is k-choosable if it admits a vertex-coloring whenever the colors allowed at each vertex are restricted to a list of length k. If χ denotes the usual chromatic number of G, we are interested in which kind of G is χ-choosable. This question contains a famous conjecture, which states that ev

Characterization of graphs with equal do

Characterization of graphs with equal domination and covering number

✍ Bert Randerath; Lutz Volkmann 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 592 KB

Let G be a simple graph of order n(G). A vertex set D of G is dominating if every vertex not in D is adjacent to some vertex in D, and D is a covering if every edge of G has at least one end in D. The domination number 7(G) is the minimum order of a dominating set, and the covering number/~(G) is th