✦ LIBER ✦

Distance paired domination numbers of graphs

✍ Scribed by Joanna Raczek

Book ID: 108113836
Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 197 KB
Volume: 308
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2007.05.018

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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

On the distance paired domination of

✍ Haoli Wang; Xirong Xu; Yuansheng Yang; Kai Lü 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 1017 KB

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

Graphs with large paired-domination numb

Graphs with large paired-domination number

✍ Michael A. Henning 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 560 KB