𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Complexity of distance paired-domination problem in graphs

✍ Scribed by Chang, Gerard J.; Panda, B.S.; Pradhan, D.

Book ID
119375403
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
363 KB
Volume
459
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Paired-domination in graphs
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 in Claw-Free Graphs
Paired-Domination in Claw-Free Graphs
✍ Shenwei Huang, Liying Kang, Erfang Shan πŸ“‚ Article πŸ“… 2012 πŸ› Springer Japan 🌐 English βš– 382 KB
On the distance paired domination of
On the distance paired domination of
✍ Haoli Wang; Xirong Xu; Yuansheng Yang; Kai LΓΌ πŸ“‚ Article πŸ“… 2009 πŸ› Springer US 🌐 English βš– 1017 KB