EQUITABLE RINGS DOMINATION IN GRAPHS
Publish place: Journal of Algebraic Systems، Vol: 13، Issue: 2
Publish Year: 1404
Type: Journal paper
Language: English
View: 25
This Paper With 13 Page And PDF Format Ready To Download
- Certificate
- I'm the author of the paper
Export:
Document National Code:
JR_JAS-13-2_010
Index date: 15 March 2025
EQUITABLE RINGS DOMINATION IN GRAPHS abstract
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.
EQUITABLE RINGS DOMINATION IN GRAPHS Keywords:
EQUITABLE RINGS DOMINATION IN GRAPHS authors
Mark Caay
Department of Mathematics and Physics, Adamson University, P.O. Box ۱۰۱۳, Ermita Manila City, Metro Manila, Philippines.
مراجع و منابع این Paper:
لیست زیر مراجع و منابع استفاده شده در این Paper را نمایش می دهد. این مراجع به صورت کاملا ماشینی و بر اساس هوش مصنوعی استخراج شده اند و لذا ممکن است دارای اشکالاتی باشند که به مرور زمان دقت استخراج این محتوا افزایش می یابد. مراجعی که مقالات مربوط به آنها در سیویلیکا نمایه شده و پیدا شده اند، به خود Paper لینک شده اند :
