The domination parameters of a graph G of order n has been already introduced. It is defined as D⊆V(G) is a dominating set of G, if every vertex v∈V-D is adjacent to atleast one vertex in D. In this paper, we have established various domination parameters of Mongolian Tent , also we have studied the relation between this parameters and illustrated with an examples.
Impact Factor
2022: 6.012
This work is licensed under a