✦ LIBER ✦

On connected k-domination numbers of graphs

✍ Scribed by Shougui Li

Book ID: 108315904
Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 204 KB
Volume: 274
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(03)00203-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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 edge domination numbers of graphs

✍ Baogen Xu 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 166 KB

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

On weakly connected domination in graphs

✍ Jean E. Dunbar; Jerrold W. Grossman; Johannes H. Hattingh; Stephen T. Hedetniemi 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 497 KB

A weakly connected dominating set for a connected graph is a dominating set D of vertices of the graph such that the edges not incident to any vertex in D do not separate the graph. This paper considers the weakly connected domination number, 7w, and related domination parameters. It is shown that t

On domination in connected cubic graphs

✍ A.V. Kostochka; B.Y. Stodolsky 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 112 KB