Corpus ID: 117810229

Weakly connected domination critical graphs

@article{Lemanska2008WeaklyCD,
  title={Weakly connected domination critical graphs},
  author={Magdalena Lemanska and A. Patyk},
  journal={Opuscula Mathematica},
  year={2008},
  volume={28},
  pages={325-330}
}
  • Magdalena Lemanska, A. Patyk
  • Published 2008
  • Mathematics
  • Opuscula Mathematica
  • A dominating set \(D \subset V(G)\) is a weakly connected dominating set in \(G\) if the subgraph \(G[D]_w = (N_{G}[D],E_w)\) weakly induced by \(D\) is connected, where \(E_w\) is the set of all edges with at least one vertex in \(D\). The weakly connected domination number \(\gamma_w(G)\) of a graph \(G\) is the minimum cardinality among all weakly connected dominating sets in \(G\). The graph is said to be weakly connected domination critical (\(\gamma_w\)-critical) if for each \(u, v \in V… CONTINUE READING
    9 Citations
    A characterisation of cycle-disjoint graphs with unique minimum weakly connected dominating set
    • PDF
    Weakly connected Roman domination in graphs
    NONSPLIT DOMINATION EDGE CRITICAL GRAPHS
    SPLIT DOMINATION VERTEX AND EDGE CRITICAL GRAPHS
    Independent domination critical and stable graphs upon edge subdivision
    • 5
    • PDF
    Weakly connected dominating sets in the lexicographic product of graphs
    • 2
    • PDF

    References

    SHOWING 1-4 OF 4 REFERENCES
    On weakly connected domination in graphs
    • 67
    Domination critical graphs
    • 165
    • PDF
    Connected domination critical graphs
    • 26
    • PDF
    Domination Numbers in Graphs with Removed Edge or Set of Edges
    • 3
    • PDF