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

@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},
  }