Characterization of A Graphs with Signed Domination Number One W.R.T Induced Subgraphs Are Totally Disconnected, Path, Cycle and Complete Graph

References

[1] Acharya, B. D. (1980). Domination in signed graphs. National Academy Science Letters, 3, 365–368.

[2] Brualdi, R. A. (2009). Signed domination number of a graph/matrix. Institute for Research in Fundamental Sciences. Retrieved from https://math.ipm.ac.ir/conferences/2009/combinatorics2009/slides/brualdi.pdf

[3] Dunbar, J. E., Hedetniemi, S. M., Hedetniemi, S. T., & Henning, M. A. (2000). Signed domination in graphs. Graph Theory, Combinatorics, and Applications, 2, 311–322.

[4] Favaron, O. (1996). Signed domination in regular graphs. Discrete Mathematics, 158(1–3), 287–293. https://doi.org/10.1016/0012-365X(95)00225-5

[5] Haas, R., & Wexler, T. B. (2004). Signed domination number of a graph and its complement. Discrete Mathematics, 286(1–2), 149–153. https://doi.org/10.1016/j.disc.2004.06.015

[6] Haynes, T. W., Hedetniemi, S. T., & Slater, P. J. (1998). Fundamentals of domination in graphs. Marcel Dekker.

[7] Hong, Y., Li, J., & Wu, K. (2021). The generalization of signed domination number of two classes of graphs. Open Journal of Discrete Mathematics, 11(4), 117–126. Retrieved from https://www.scirp.org/pdf/ojdm_2021102610042813.pdf

[8] J.Dunbar, S.T. Hedetniemi, M.A. Henning and P.J.Slater (1995), Signed Domination in Graphs, Graph Theory, Combinatorics and Applications, Proceedings 7th Internat. Conf. Combinatorics, Graph Theory, Applications, 311- 322.

[9] Martínez, E., & Rodríguez, J. A. (2020). Signed domination in product graphs. Discrete Applied Mathematics, 283, 494–503. https://doi.org/10.1016/j.dam.2020.05.015

[10] O. Favaron, (1995), Signed Domination in Regular Graphs, Discrete Math., 158, 287-293.

[11] F.Harary, (1988), Graph Theory, Narosa Publishing House, New-Delhi.

[12] R.Hass, and T.B.Wexler, (2001), Signed Domination Number of a Graph and its Complement, Preprint Submitted to Elsevier Preprint on 7 September 2001.

[13] Henning, M. A., & Yeo, A. (2013). Total signed domination in graphs. Discrete Mathematics, 313(5), 555–564. https://doi.org/10.1016/j.disc.2012.11.014

[14] H.B.Walikar and M.S.Patil, Signed Domination Number Zero, Negative and Positive, International Journal of Mathematics & Applications Vol.2, No.1-2, (January-December 2009), pp. 113-119

[15] J. Hattingh, M.A.Henning and P.J.Slater, (1995), The Algorithmic Complexity of Signed Domination in Graphs, Australas. J.Combin, 12, 101-112

[16] Mojdeh, D. A., Samadi, B., & Volkmann, L. (2018). Bounds on the nonnegative signed domination number of graphs. arXiv preprint arXiv:1809.08630. Retrieved from https://arxiv.org/abs/1809.08630

[17] M.S. Patil (2007) Some topics in the Theory of Domination in Graphs, X plan FIP Ph.D work supported by UGC, Govt. of India.

[18] B.Zelinka, (2001), Signed Total Domination Number of a Graph, Czechoslovak Mathematical Journal, 51126, 225-229

[19] Singh, R., & Ghosh, S. (2023). Applications of domination in graph theory. Journal of Applied Mathematics and Computation, 47(3), 231–248.

[20] Jin Martousek, (2000), On the Signed Domination in Graphs, Combinatorica, 20,103-108.

[21] Siva Parvathi, M., & Siva Krishna, D. (2017). Signed Roman domination number of corona graph Cn∘KmC_n \circ K_mCn​∘Km​. International Journal of Innovative Research in Science, Engineering and Technology, 6(Special Issue 13), 124–128. Retrieved from https://www.ijirset.com/upload/2017/ncrtamst/21_Signed.pdf

[22] Volkmann, L., & Zelinka, B. (2005). Signed domatic number of a graph. Discrete Applied Mathematics, 150(1–3), 261–267. https://doi.org/10.1016/j.dam.2004.12.010

[23] Z.Zhang, B.Xu, Y.Li, and Liu, (1999), A Note on the Lower Bounds of Signed Domination Number of a Graph, Discrete Math., 195, 295-298.

@article{1704897,
      author = {M. S. Patil},
      title = {Characterization of A Graphs with Signed Domination Number One W.R.T Induced Subgraphs Are Totally Disconnected, Path, Cycle and Complete Graph},
      journal = {Iconic Research And Engineering Journals},
      year = {2023},
      volume = {7},
      number = {1},
      pages = {650-660},
      issn = {2456-8880},
      url = {https://www.irejournals.com/formatedpaper/1704897.pdf},
      abstract = {A two-valued function f defined on the vertices of a graph G=(V, E),
?: ? ? {?1, 1}	is a signed dominating function (SDF) if the sum of its function values over any closed neighborhood is at least one. The weight of a signed dominating function is defined to be (?) = ? ?(?), over all vertices ? ? ?. The signed dominating number of a graph G, denoted by ??(?) ??? ??(?) = min{w(?)}, where f is signed dominating function of G. In this paper, characterize the class of graphs for signed domination number one with respective to induced subgraphs.},
      keywords = {Signed dominating function, Signed domination number and induced sub graph},
      month = {July},
  }