✦ LIBER ✦

Paired Domination Vertex Critical Graphs

✍ Scribed by Xinmin Hou; Michelle Edwards

Publisher: Springer Japan
Year: 2008
Tongue: English
Weight: 125 KB
Volume: 24
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-008-0806-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Vertex domination-critical graphs

✍ Jason Fulman; Denis Hanson; Gary Macgillivray 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 293 KB

Vertex domination-critical graphs

✍ Robert C. Brigham; Phyllis Z. Chinn; Ronald D. Dutton 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 303 KB

Matching Properties in Total Domination

Matching Properties in Total Domination Vertex Critical Graphs

✍ Haichao Wang; Liying Kang; Erfang Shan 📂 Article 📅 2009 🏛 Springer Japan 🌐 English ⚖ 200 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

Paired-Domination inP5-Free Graphs

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

Domination critical graphs

✍ David P Sumner; Pattie Blitch 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 531 KB