Author(s)

Xia Hong¹, Guoyan Ao², Feng Gao¹

¹Department of Mathematics, Luoyang Normal University, Luoyang, China.
²School of Mathematics and Statistics, Hulunbuir University, Inner Mongolia, China.

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 .

Signed Domination Function, Signed Domination Numbers, Graphs C_n^k, Graphs P_n^k

Hong, X. , Ao, G. and Gao, F. (2021) The Generalization of Signed Domination Number of Two Classes of Graphs. Open Journal of Discrete Mathematics, 11, 114-132. doi: 10.4236/ojdm.2021.114009.