TOTAL RESTRAINED EDGE MONOPHONIC DOMINATION NUMBER M OF A GRAPH | Asian Journal of Mathematics

The total restrained edge monophonic domination number M of a graph G is introduced in this study. A whole restrained edge monophonic dominating set M of a graph G is a restrained edge monophonic dominating set M such that the subgraph induced by M has no isolated vertices for a connected graph G = (V,E) of order at least two. A - set of G is a whole restrained edge monophonic dominant set of cardinality. It is demonstrated that if pand k are positive integers such that 3 k p, then there exists a connected graph G of rank P with = k. Also There exists a connected graph G such that me(G) = a, and = d for any positive integers 3 a b c d.

Please see the link :- https://www.ikprress.org/index.php/AJOMCOR/article/view/940