Author:
Santha S.,Krishna Veni G.T.
Abstract
Abstract
A set D of vertices in a graph G (V, E) is a dominating set of G, if every vertex in V-D is adjacent to at least one vertex in D. If V-D contains a dominatingset D’ of
G then D’ is called an inverse dominating set with respect to
D. In this paper we have established some theorems and properties of the inverse domination number to the transformation of path related graphs.
Subject
General Physics and Astronomy
Reference7 articles.
1. Inverse domination in graph;Kulli;Nat. Acad. Sci. Letters,1991
2. On domination inverse domination numbers of a graph;Allan;Discrete Math.,1978
3. Towards a theory of domination in graphs;Cockayne;Networks,1977
4. The Transformation Graph Gxyz when xyz = − + +;Wu;Discrete Math.,2005