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 1.}$ 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.
S. S. Abed and M. N. Al-Harere, Rings Domination in Graphs, Int. J. Nonlinear Anal. Appl., 13(2) (2022), 1833–1839.
A. Anitha, S. Arumugam and M. Chellali, Equitable Domination in Graphs, Discrete Math. Algorithms Appl., 3(03) (2011), 311–321.
C. Berge, The Theory of Graphs and Its Applications, Methuen, 1962.
M. L. Caay and E. B. Arugay, Perfect Equitable Domination of Some Graphs, International Mathematical Forum, 12(18) (2017), 891–900.
M. L. Caay and M. B. Durog, On Some Independent Equitable Domination of Graphs, Gulf J. Math., 11(1) (2021), 57–64.
G. Deepak, N. D. Sooner and A. Alwardi, The Equitable Bondage Number of a Graph, Research Journal of Pure Algebra, 1(9) (2011), 209–212.
S. H. Mirhoseini and N. Jafari Rad, On the Computational Complexity Aspects of Perfect Roman Domination, J. Algebr. Syst., 10(2) (2023), 189–202.
S. Wisweswaran and P. Sarman, On the Domination Number of the Sum Annihilating Ideal Graph of a Commutative Ring and on the Domination Number of Its Complement,
Algebr. Syst., 11(2) (2024), 155–177.
Articles in Press, Accepted Manuscript Available Online from 09 April 2024
)