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