EQUITABLE RINGS DOMINATION IN GRAPHS

A dominating set S of G is an \textit{equitable dominating set} of G if for every v \in V(G) \setminus S, there exists u \in S such that uv \in V(G) and \displaystyle{\left|\deg(u) - \deg(v)\right| \leq ۱.} A dominating set S of G is a \textit{rings dominating set} of G if every vertex v \in V(G) \setminus S is adjacent to atleast two vertices V(G) \setminus S. In this paper, we examine the conditions at which the equitable dominating set and the rings dominating set coincide, and thus naming the dominating set as \textit{equitable rings dominating set}. The minimum cardinality of an equitable rings dominating set of a graph G is called the \textit{equitable rings domination number} of G, and is denoted by \gamma_{eri}(G). Moreover, we examine determine the equitable rings domination number of many graphs, and graphs formed by some binary operations.

کلیدواژه ها:

domination ، equitable domination ، rings domination ، equitable domination rings domination