ON PAIRED DOUBLE DOMINATION NUMBERS OF SOME GRAPHS

Abstract

In this paper , we continue the study of paired double domination in graphs . A paired – double dominating set of a graph G with no isolated vertex is a double dominating sets of vertices whose induced subgraph  has a perfect matching . We establish Paired double domination number of graphs (i) identifying vertices of Union Cycle and Path say D (ii) identifying vertices of two cycles say H with same order and different order.