ON THE STRONG DOMINATING SETS OF GRAPHS
Author(s):
Article Type:
Research/Original Article (دارای رتبه معتبر)
Abstract:
Let $G=(V(G),E(G))$ be a simple graph. A set $D\subseteq V(G)$ is a strong dominating set of $G$, if for every vertex $x\in V(G)\setminus D$ there is a vertex $y\in D$ with $xy\in E(G)$ and $deg(x)\leq deg(y)$. The strong domination number $\gamma_{st}(G)$ is defined as the minimum cardinality of a strong dominating set. In this paper, we calculate $\gamma_{st}(G)$ for specific graphs and study the number of strong dominating sets of some graphs.
Keywords:
Language:
English
Published:
Journal of Algebraic Systems, Volume:11 Issue: 1, Summer-Autumn 2023
Pages:
65 to 76
https://www.magiran.com/p2540611
سامانه نویسندگان
مقالات دیگری از این نویسنده (گان)
-
Pebbling Number of Polymers
Fatemeh Aghaei, *
Iranian Journal of Mathematical Chemistry, Winter 2025 -
A New Algorithm for Computing the Frobenius Number
Abbas Taheri, *
Journal of Algorithms and Computation, Dec 2023