✦ LIBER ✦

Graphs with equal eternal vertex cover and eternal domination numbers

✍ Scribed by William F. Klostermeyer; C.M. Mynhardt

Book ID: 108114313
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 269 KB
Volume: 311
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2011.03.026

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Vertex covers and eternal dominating set

Vertex covers and eternal dominating sets

✍ William F. Klostermeyer; C.M. Mynhardt 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 238 KB

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 with equal domination and cove

On graphs with equal domination and covering numbers

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

On graphs with equal total domination an

On graphs with equal total domination and connected domination numbers

✍ Xue-gang Chen 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 152 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