Point Set Domination with Reference to Degree
R. Poovazhaki, V. Swaminathan · International Journal of Mathematics and Soft Computing · 2011
E.Sampathkumar et al introduced [7] the concept of point set domination number of a graph. A set D ⊆ V (G) is said to be a point set dominating set (psd set), if for every S ⊆ V − D there exists a vertex u ∈ D such that the subgraph 〈S ∪ {u} 〉 induced by S ∪ {u} is connected. The minimum cardinality of a psd set is called the point set domination number of G and is denoted by γp(G).In this paper psd sets are analysed with respect to the strong [9] domination parameter for separable graphs. The characterization of separale graphs with equal psd number and spsd number is derived. Key words: separable graph, point set domination, strong point set domination AMS Subject Classification(2010): 05C69 1