%0 Journal Article %T The Generalization of Signed Domination Number of Two Classes of Graphs %A Xia Hong %A Guoyan Ao %A Feng Gao %J Open Journal of Discrete Mathematics %P 114-132 %@ 2161-7643 %D 2021 %I Scientific Research Publishing %R 10.4236/ojdm.2021.114009 %X 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 \"\". %K Signed Domination Function %K Signed Domination Numbers %K Graphs C< %K sub> %K n< %K /sub> %K < %K sup style=" %K margin-left:-7px %K " %K > %K k< %K /sup> %K Graphs P< %K sub> %K n< %K /sub> %K < %K sup style=" %K margin-left:-7px %K " %K > %K k< %K /sup> %U http://www.scirp.org/journal/PaperInformation.aspx?PaperID=112729