Locating Total Dominating Sets in the Join, Corona and Composition of Graphs

@article{Omamalin2014LocatingTD,
  title={Locating Total Dominating Sets in the Join, Corona and Composition of Graphs},
  author={Benjamin N. Omamalin and S. Canoy and Helen M. Rara},
  journal={Applied mathematical sciences},
  year={2014},
  volume={8},
  pages={2363-2374}
}
Let G =( V (G),E(G)) be a connected graph. A subset S of V (G) is a total dominating set of G if every vertex of G is adjacent to some vertex in S. The set NG(v) is the set of all vertices of G adjacent to v .A subset S of V (G) is a locating set of G if NG(u)∩SNG(v)∩S for every two distinct vertices u and v in V (G) \ S. A locating subset S of V (G) which is also a total dominating set is called a locating total dominating set of G. The minimum cardinality of a locating total dominating set of… Expand
3 Citations
Domination Parameters in Hypertrees
Domination parameters in hypertrees and sibling trees
  • 1
  • PDF
A Note on the Locating-Total Domination in Graphs
  • 2

References

SHOWING 1-10 OF 13 REFERENCES
Locating and total dominating sets in trees
  • 114
Point determination in graphs
  • D. Sumner
  • Computer Science, Mathematics
  • Discret. Math.
  • 1973
  • 59
Nuclei for totally point determining graphs
  • 5
Fundamentals of domination in graphs
  • 3,158
  • PDF
Determining the intruders location in a given network: Locating-dominating sets in a graph
  • NCRP Research Journal
  • 2013
Malacas, Determining the intruders location in a given network: Locating-dominating sets in a graph
  • NCRP Research Journal. 13(2013),
  • 2013
Critical Graphs With Respect to Vertex Identification
  • 2008
Critical graphs with respect to vertex identification, Utilitas Math
  • Critical graphs with respect to vertex identification, Utilitas Math
  • 2008
Mynhardt and R.D Skaggs, Critical graphs with respect to vertex identification
  • Utilitas Math
  • 2008
...
1
2
...