✦ LIBER ✦

Bounds on the connected -domination number in graphs

✍ Scribed by Adriana Hansberg

Book ID: 108112884
Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 234 KB
Volume: 158
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2010.05.021

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

On connected k-domination numbers of gra

On connected k-domination numbers of graphs

✍ Shougui Li 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 204 KB

Upper bounds for ƒ-domination number of

Upper bounds for ƒ-domination number of graphs

✍ Beifang Chen; Sanming Zhou 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 200 KB

Bounds of Laplacian spectrum of graphs b

Bounds of Laplacian spectrum of graphs based on the domination number

✍ Mei Lu; Huiqing Liu; Feng Tian 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 189 KB

Bounds on the -domination number of a gr

Bounds on the -domination number of a graph

✍ Ermelinda DeLaViña; Wayne Goddard; Michael A. Henning; Ryan Pepper; Emil R. Vaug 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 200 KB

The k-domination number of a graph is the cardinality of a smallest set of vertices such that every vertex not in the set is adjacent to at least k vertices of the set. We prove two bounds on the k-domination number of a graph, inspired by two conjectures of the computer program Graffiti.pc. In part