✦ LIBER ✦

Paired-Domination in Subdivided Star-Free Graphs

✍ Scribed by Paul Dorbec; Sylvain Gravier

Publisher: Springer Japan
Year: 2010
Tongue: English
Weight: 192 KB
Volume: 26
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-010-0893-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Paired-Domination inP5-Free Graphs

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

Paired-domination in generalized claw-fr

Paired-domination in generalized claw-free graphs

✍ Paul Dorbec; Sylvain Gravier; Michael A. Henning 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 191 KB

Upper paired-domination in claw-free gra

Upper paired-domination in claw-free graphs

✍ Paul Dorbec; Michael A. Henning 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 626 KB

Paired-Domination in Claw-Free Cubic Gra

Paired-Domination in Claw-Free Cubic Graphs

✍ Odile Favaron; Michael A. Henning 📂 Article 📅 2004 🏛 Springer Japan 🌐 English ⚖ 377 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

Domination in quadrangle-free helly grap

Domination in quadrangle-free helly graphs

✍ F. F. Dragan 📂 Article 📅 1994 🏛 Springer US 🌐 English ⚖ 705 KB