On Paired Domination of Some Graphs

For a graph a subset D of the vertex set is called a dominating set if every vertex in is adjacent to some vertex in D. The domination number is the minimum cardinality of a dominating set of a graph G. The paired dominating set of a graph is a dominating set and the subgraph induced by it contains a perfect matching. The paired domination number is the minimum cardinality of a paired dominating set in G. In this paper, we discuss the paired domination number of the graphs obtained by the kth power of path and cycle and degree splitting graphs of some standard graphs.