Research ArticleOpen AccessGoogle Scholar indexed
The Generalization of Signed Domination Number of Two Classes of Graphs
Department of Mathematics, Luoyang Normal University, Luoyang, China
School of Mathematics and Statistics, Hulunbuir University, Inner Mongolia, China
Department of Mathematics, Luoyang Normal University, Luoyang, China
- 1 Department of Mathematics, Luoyang Normal University, Luoyang, China
- 2 School of Mathematics and Statistics, Hulunbuir University, Inner Mongolia, China
- 3 Department of Mathematics, Luoyang Normal University, Luoyang, China
Open Journal of Discrete Mathematics·Volume 11 (2021)·Pages 114–132·Published 19 October 2021·DOI10.4236/ojdm.2021.114009
Copy link · social · email
Abstract
Let be a graph. A function is said to be a Signed Dominating Function (SDF) if holds for all . The signed domination number . In this paper, we determine the exact value of the Signed Domination Number of graphs and for , which is generalized the known results, respectively, where and are denotes the k -th power graphs of cycle and path .
KeywordsSigned Domination FunctionSigned Domination NumbersGraphs C<sub>n</sub><sup style="margin-left:-7px">k</sup>Graphs P<sub>n</sub><sup style="margin-left:-7px">k<
- Bondy, J.A. and Murty, U.S.R. (2008) Graph Theory. GTM 244, Springer, London.
- Gao, H., Cao, H. and Yang, Y. (2018) On the Total Signed Domination Number of . Ars Combinatoria, 136, 3-19.
- Li, W., Huang, Z., Feng, Z. and Wu, D. (2017) 2-Signed Total Domination Number of Graphs. Journal of Jiangsu Normal University, 35, 31-33. (In Chinese)
- Xu, B. (2008) Control Theory of Graphs. Science Press, Beijing. (In Chinese)
- Zelinka, B. (2001) Signed Total Domination Number of a Graph. Czechoslovak Mathematical Journal, 51, 225-229. https://doi.org/10.1023/A:1013782511179
- Ebrahimi, B.J., Jahanbakht, N. and Mahmoodianc, E.S. (2009) Vertex Domination of Generalized Petersen Graphs. Discrete Mathematics, 309, 4355-4361. https://doi.org/10.1016/j.disc.2009.01.018
- Xu, B. (2001) On Signed Edge Domination Numbers of Graphs. Discrete Mathematics, 239, 179-189. https://doi.org/10.1016/S0012-365X(01)00044-9
- Dunbar, J., Hedetniemi, S., Henning, M.A. and Mcrae, A.A. (1996) Minus Domination in Regular Graphs. Discrete Mathematics, 149, 311-312. https://doi.org/10.1016/0012-365X(94)00329-H
- Pi, X.M. (2018) On the Characterization of Maximal Planar Graphs with a Given Signed Cycle Domination Number. Acta Mathematica Sinica, English Series, 34, 911-920. https://doi.org/10.1007/s10114-017-6283-3
- Zhao, Y. and Miao, L. (2017) Signed Roman (Total) Domination Numbers of Complete Bipartite Graphs and Wheels. Communications in Mathematical Research, 33, 318-326.
- Alhevaz, A., Darkooti, M., Rahbani, H. and Shang, Y. (2019) Strong Equality of Perfect Roman and Weak Roman Domination in Trees. Mathematics, 7, Article No. 997. https://doi.org/10.3390/math7100997
- Mojdeh, D.A. and Samadi, B. (2017) On the Inverse Signed Total Domination Number in Graphs. Opuscula Mathematica, 37, 447-456. https://doi.org/10.7494/OpMath.2017.37.3.447
- Yu, C. and Xu, B. (1997) Signed Domination Number in Graphs. Journal of East China Jiaotong University, 14, 54-58, 67. (In Chinese)
- Ding, D. (2012) The Signed Domination Number of Graph. Journal of Yichun College, 34, 21-23. (Chinese)
- Kong, X., Xu, B. and Chuanming, L. (2013) The Signed Domination Numbers of Some Special Graphs. Journal of Science of Teacher’s College and University, 33, 5-7. (In Chinese)