Few Results on Paired Domination Number of Some Graphs

Abstract

The paired dominating set D of graph G is the subset of vertex set of graph G such that the subset D is dominating set and the subgraph induced by D contains perfect Matching. The paired domination number is the minimum cardinality of a paired dominating set D of graph G. In this paper we discuss the paired domination number of middle graph and total graph of paths and cycles. It will be followed by the discussion on paired domination number of splitting graph, shadow graph and the graphs obtained by switching of the vertices of paths and cycles.