.

ISSN 2063-5346
For urgent queries please contact : +918130348310

REGULAR PERFECT DOMINATION IN GRAPH

Main Article Content

DR.M.H.MUDDEBIHAL, FAIMIDAi BEGUM
» doi: 10.48047/ecb/2023.12.si6.350

Abstract

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).

Article Details