✦ LIBER ✦

Paired-Domination Subdivision Numbers of Graphs

✍ Scribed by O. Favaron; H. Karami; S. M. Sheikholeslami

Publisher: Springer Japan
Year: 2009
Tongue: English
Weight: 153 KB
Volume: 25
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-005-0871-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Roman domination subdivision number of g

Roman domination subdivision number of graphs

✍ M. Atapour; S. M. Sheikholeslami; Abdollah Khodkar 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 268 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 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

Domination numbers of planar graphs

✍ MacGillivray, G.; Seyffarth, K. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 967 KB

The problem of determining the domination number of a graph is a well known NPhard problem, even when restricted to planar graphs. By adding a further restriction on the diameter of the graph, we prove that planar graphs with diameter two and three have bounded domination numbers. This implies that