✦ LIBER ✦

On graphs with equal domination and covering numbers

✍ Scribed by Lutz Volkmann

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 505 KB
Volume: 51
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(94)90110-4

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

On graphs whose domination numbers equal

On graphs whose domination numbers equal their independent domination numbers

✍ Belmannu Devadas Acharya; Purnima Gupta 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 185 KB

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

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.

Domination numbers of planar graphs

✍ MacGillivray, G.; Seyffarth, K. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 967 KB

The problem of determining the domination number of a graph is a well known NPhard problem, even when restricted to planar graphs. By adding a further restriction on the diameter of the graph, we prove that planar graphs with diameter two and three have bounded domination numbers. This implies that

On total matching numbers and total cove

On total matching numbers and total covering numbers of complementary graphs

✍ P. Erdös; A. Meir 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 455 KB