✦ LIBER ✦

Graphs with large paired-domination number

✍ Scribed by Michael A. Henning

Publisher: Springer US
Year: 2006
Tongue: English
Weight: 560 KB
Volume: 13
Category: Article
ISSN: 1382-6905
DOI: 10.1007/s10878-006-9014-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Graphs with large total domination numbe

Graphs with large total domination number

✍ Michael A. Henning 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 246 KB 👁 1 views

Paired-domination in graphs

✍ Haynes, Teresa W.; Slater, Peter J. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 145 KB 👁 3 views

In a graph G Å (V, E) if we think of each vertex s as the possible location for a guard capable of protecting each vertex in its closed neighborhood N[s], then ''domination'' requires every vertex to be protected. Thus, S ʚ V (G) is a dominating set if ʜ s √ S N[s] Å V (G). For total domination, eac

Domination number of cubic graphs with l

Domination number of cubic graphs with large girth

✍ Daniel Král'; Petr Škoda; Jan Volec 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 219 KB

We show that every n-vertex cubic graph with girth at least g have domination number at most 0.299871n+O(n / g) < 3n / 10+O(n / g) This research was done when the Petr Škoda was a student of

Paired Domination Vertex Critical Graphs

✍ Xinmin Hou; Michelle Edwards 📂 Article 📅 2008 🏛 Springer Japan 🌐 English ⚖ 125 KB

Paired-Domination inP5-Free Graphs

✍ Paul Dorbec; Sylvain Gravier 📂 Article 📅 2008 🏛 Springer Japan 🌐 English ⚖ 189 KB

Paired-Domination Subdivision Numbers of

Paired-Domination Subdivision Numbers of Graphs

✍ O. Favaron; H. Karami; S. M. Sheikholeslami 📂 Article 📅 2009 🏛 Springer Japan 🌐 English ⚖ 153 KB