Gao, H., Cao, H. and Yang, Y. (2018) On the Total Signed Domination Number of . Ars Combinatoria, 136, 3-19.

has been cited by the following article:

• TITLE: The Generalization of Signed Domination Number of Two Classes of Graphs

  AUTHORS: Xia Hong, Guoyan Ao, Feng Gao

  KEYWORDS: Signed Domination Function, Signed Domination Numbers, Graphs Cnk, Graphs Pnk

  JOURNAL NAME: Open Journal of Discrete Mathematics, Vol.11 No.4, October 27, 2021

  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 .