Point set domination number of a graph
E. Sampathkumar, L. Pushpalatha · MyPrints@UOM (Mysore University Library) · 1993
A set D of vertices in a connected graph G is a `psd-set' if for every set S subset-or-equal-to V-D there exists a vertex nu is-an-element-of D such that the subgraph S or {nu}] induced by S or {nu} is connected. The point-set domination number' gamma(p)(G) of G is the minimum cardinality of a psd-set. Besides some bounds, exact values of gamma(p)(G) are determined when G is a tree, block graph and cactus. A generalization of gamma(p)(G) is also considered.