332
Views
0
CrossRef citations to date
0
Altmetric
Articles

Lower bounds on nonnegative signed domination parameters in graphs

References

  • WestD.B., Introduction to Graph Theory2000Prentice-Hall, Inc
  • CockayneE.J.MynhardtC.M., On a generalization of signed dominating function of graphs Ars Combin.1996 235–245
  • ChenW.SongE., Lower bounds on several versions of signed domination number Disceret Math. 3082008 1837–1846
  • DunbarJ.HedetniemiS.T.HenningM.A.SlaterP.J., Signed Domination in Graphs, Graph Theory, Combinatorics, and Applications, Vol. 11995WileyNew York311–322
  • HaynesT.W.HedetniemiS.T.SlaterP.J., Domination in Graphs: Advance Topics1998Marcel Dekker, Inc.New York
  • HuangZ.LiW.FengZ.XingH., On nonnegative signed domination in graphs and its algorithmic complexity J. Netw. (2)2013 365–372
  • AtapourM.SheikholeslamiS.M., On the nonnegative signed domination numbers in graphs Electron. J. Graph Theory Appl. (2)2016 231–237
  • HenningM.A., Domination in regular graphs Ars Combin.1996 263–271