The forcing nonsplit domination number of a graph
1
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
A dominating set $S$ of a graph $G$ is said to be nonsplit dominating set if the subgraph $\langle V-S \rangle$ is connected. The minimum cardinality of a nonsplit dominating set is called the nonsplit domination number and is denoted by $\gamma_{ns}(G)$. For a minimum nonsplit dominating set $S$ of $G$, a set $T \subseteq S$ is called a forcing subset for $S$ if $S$ is the unique $\gamma_{ns}$-set containing $T$. A forcing subset for $S$ of minimum cardinality is a minimum forcing subset of $S$. The forcing nonsplit domination number of $S$, denoted by $f_{\gamma ns}(S)$, is the cardinality of a minimum forcing subset of $S$. The forcing nonsplit domination number of $G$, denoted by $f_{\gamma ns}(G)$ is defined by $f_{\gamma ns}(G)= min \{f_{\gamma ns}(S)\}$, where the minimum is taken over all $\gamma_{ns}$-sets $S$ in $G$. The forcing nonsplit domination number of certain standard graphs are determined. It is shown that, for every pair of positive integers $a$ and $b$ with $0 \leq a \leq b$ and $b \geq 1 $, there exists a connected graph $G$ such that $f_{\gamma ns}(G)=a$ and $\gamma_{ns}(G)=b$. It is shown that, for every integer $a \geq 0$, there exists a connected graph $G$ with $f_\gamma(G)=f_{\gamma ns}(G)=a$, where $f_\gamma(G)$ is the forcing domination number of the graph. Also, it is shown that, for every pair $a, b$ of integers with $a \geq0$ and $b \geq 0$ there exists a connected graph $G$ such that $f_\gamma(G)=a$ and $f_{\gamma ns}(G)=b$.
Abstract
A dominating set $S$ of a graph $G$ is said to be nonsplit dominating set if the subgraph $\langle V-S \rangle$ is connected. The minimum cardinality of a nonsplit dominating set is called the nonsplit domination number and is denoted by $\gamma_{ns}(G)$. For a minimum nonsplit dominating set $S$ of $G$, a set $T \subseteq S$ is called a forcing subset for $S$ if $S$ is the unique $\gamma_{ns}$-set containing $T$. A forcing subset for $S$ of minimum cardinality is a minimum forcing subset of $S$. The forcing nonsplit domination number of $S$, denoted by $f_{\gamma ns}(S)$, is the cardinality of a minimum forcing subset of $S$. The forcing nonsplit domination number of $G$, denoted by $f_{\gamma ns}(G)$ is defined by $f_{\gamma ns}(G)= min \{f_{\gamma ns}(S)\}$, where the minimum is taken over all $\gamma_{ns}$-sets $S$ in $G$. The forcing nonsplit domination number of certain standard graphs are determined. It is shown that, for every pair of positive integers $a$ and $b$ with $0 \leq a \leq b$ and $b \geq 1 $, there exists a connected graph $G$ such that $f_{\gamma ns}(G)=a$ and $\gamma_{ns}(G)=b$. It is shown that, for every integer $a \geq 0$, there exists a connected graph $G$ with $f_\gamma(G)=f_{\gamma ns}(G)=a$, where $f_\gamma(G)$ is the forcing domination number of the graph. Also, it is shown that, for every pair $a, b$ of integers with $a \geq0$ and $b \geq 0$ there exists a connected graph $G$ such that $f_\gamma(G)=a$ and $f_{\gamma ns}(G)=b$.
참고문헌 (18)
- H. Abdollahzadeh Ahangar, "The forcing domination number of Hamiltonian Cubic graphs", International Journal of Mathematical Combinatorics, 2, pp.53~57 (2009)
- D. Ali Mojdeh, "On domination and its forcing in Mycielski’s graphs", Scientia Iranica, 15(2), pp.218~222 (2008)
- C. L. Armada, "Forcing subsets for γc-sets and γt-sets in the Lexicographic Product of graphs", European Journal of Pure And Applied Mathematics, 12(4), pp.1779~1786 (2019)
- G. Chartrand, "The forcing domination number of a graph", Journal of Combinatorial Mathematics and Combinatorial Computing, 25, pp.161~174 (1997)
- R. Davila, "Total forcing versus total domination in Cubic graphs", Applied Mathematics and Computation, 354, pp.385~395 (2019)
- D. Ferrero, "The relationship between k-forcing and k-power domination", Discrete Mathematics, 341(6), pp.1789~1797 (2018)
- M. Hajian, "A new lower bound on the domination number of a graph", Journal of combinatorial Optimization[DOI]
- F. Harary, "Graph Theory" (1969), Addison-Wesley
- T. W. Haynes, "Fundamentals of Domination in Graphs" (1998), Marcel Dekker, Incorporated
- J. John, "The forcing monophonic hull number of a graph", International Journal of Mathematics Trends and Technology, 3(2), pp.43~46 (2012)
- J. John, "The forcing monophonic number of a graph", International Journal of Mathematical Archive, 3(3), pp.935~938 (2012)
- S. Kavitha, "On the forcing connected domination number of a graph", Journal of Discrete Mathematical Sciences and Cryptography, 23(3), pp.611~624 (2017)
- V. R. Kulli, "The nonsplit domination number of a graph", Indian Journal of Pure and Applied Mathematics, 31(5), pp.545~550 (2000)
- C. Sivagnanam, "Complementary connected domination number and con-nectivity of a graph", General Mathematics Notes, 29(2), pp.27~35 (2015)
- A. P. Santhakumaran, "The upper edge geodetic number and the forcing edge geodetic number of a graph", Opuscula Mathematica, 29(4), pp.427~441 (2009)
- A. P. Santhakumaran, "The forcing Steiner number of a graph", Discussiones Math-ematicae Graph Theory, 31, pp.171~181 (2011)
- A. P. Santhakumaran, "On the forcing geodetic and the forcing Steiner numbers of a graph", Discussiones Mathematicae Graph Theory, 31, pp.611~624 (2011)
- T. Tamizh Chelvam, "Complementary connected domination number", Interna-tional Journal of Management Systems, 18(2), pp.147~154 (2002)