Volume - 13 | Issue-1
Volume - 13 | Issue-1
Volume - 13 | Issue-1
Volume - 13 | Issue-1
Volume - 13 | Issue-1
Let G=(V,E) bei a graph. A perfect dominating set D⊆ V(G) is called regular perfect dominatingi set, if the induced subgraph 〈D〉 is regular. The minimum cardinality ofi D is called regular perfect domination number in a graph G and is denoted by γ_rp (G).