OUT-DEGREE EQUITABLE RESTRAINED DOMINATION IN GRAPHS
Advances and Applications in Discrete Mathematics · 27.06.2026 · 43 (6) · 803-812
DOI: 10.17654/0974165826049 ↗Kurz gefasst
Fachartikel in der Zeitschrift Advances and Applications in Discrete Mathematics, online erschienen am 27.06.2026. Verfasst von Bhaveshkumar Padhiyar und 2 weiteren Autor:innen. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
In a graph $G = (V, E)$, a subset $S \subseteq V$ is called a dominating set if every vertex in $V \setminus S$ is adjacent to at least one vertex in $S$. For each vertex $u \in S$, the number of edges between $u$ and vertices in $V \setminus S$ is defined as the out-degree of $u$ with respect to $S$. A dominating set $S$ is termed an out-degree equitable restrained dominating set if $S$ is a restrained dominating set, and every vertex outside $S$ is adjacent to a vertex in $S$ with the degree difference at most one. In this paper, we investigate fundamental properties, derive bounds, and present key results regarding out-degree equitable restrained domination in graphs.
Zitieren
APA
Padhiyar, B., Ajani, P., & Vyas, N. B. (2026). OUT-DEGREE EQUITABLE RESTRAINED DOMINATION IN GRAPHS. Advances and Applications in Discrete Mathematics, 43(6), 803-812. https://doi.org/10.17654/0974165826049
Vancouver
Padhiyar B, Ajani P, Vyas NB. OUT-DEGREE EQUITABLE RESTRAINED DOMINATION IN GRAPHS. Advances and Applications in Discrete Mathematics. 2026;43(6):803-812. doi:10.17654/0974165826049
BibTeX
@article{Padhiyar2026,
author = {Padhiyar, Bhaveshkumar and Ajani, Parag and Vyas, N. B.},
title = {OUT-DEGREE EQUITABLE RESTRAINED DOMINATION IN GRAPHS},
journal = {Advances and Applications in Discrete Mathematics},
year = {2026},
volume = {43},
number = {6},
pages = {803--812},
doi = {10.17654/0974165826049}
}
EUVIMED