Weakly connected total domination in graphs

@inproceedings{Sandueta2016WeaklyCT,
  title={Weakly connected total domination in graphs},
  author={Elsie P. Sandueta and S. Canoy},
  year={2016}
}
  • Elsie P. Sandueta, S. Canoy
  • Published 2016
  • Mathematics
    • Let G = (V (G), E(G)) be a connected undirected graph. The closed neighborhood of any vertex v ∈ V (G) is NG[v] = {u ∈ V (G) : uv ∈ E(G)} ∪ {v}. For C ⊆ V (G), the closed neighborhood of C is N [C] = ∪v∈CNG[v]. A set S ⊆ V (G) is a total dominating set ofG if for each x ∈ V (G), there exists y ∈ S such that xy ∈ E(G), that is, N(S) = V (G). A total dominating set S ⊆ V (G) is a weakly connected total dominating set of a connected graph G if the subgraph 〈S〉w = (NG(S), Ew) weakly induced by S is… CONTINUE READING
    View PDF

    References

    SHOWING 1-6 OF 6 REFERENCES
    On weakly connected domination in graphs
    • 67
    On Total Dominating Sets in Graphs
    • 6
    • PDF
    Weakly connected domination stable trees
    • 3
    • PDF
    Weakly connected independent and weakly connected total domination in a product of graphs
    • 3
    • PDF
    Weakly connected dominating sets in the lexicographic product of graphs
    • 2
    • PDF
    E
    • Sandueta and S. Canoy, Jr., Weakly connected independent and weakly connected total domination in a product of graphs, Applied Mathematical Scinces, 8
    • 2014