On Inverse Paired Domination in Some Graphs

The set of edges with no common end vertex is called a matching. A matching is perfect if every vertex of the graph is incident to an edge of the matching. The subset of vertex set is a paired dominating set if it is dominating and subgraph induced by it contains a perfect matching. The paired dominating set of minimum cardinality is called minimum paired dominating set. The paired domination number is the cardinality of a minimum paired dominating set for a graph. Let a subset paired dominating set for the graph and if the set of the vertex set contains a paired dominating set inverse paired dominating set with respect to . The inverse paired domination number be the minimum of the graph , then is an is the minimum cardinality of an inverse paired dominating set. In this paper we investigate the inverse paired domination number of power graphs and total graphs of path and cycle.