On weakly connected domination in graphs

@article{Dunbar1997OnWC,
  title={On weakly connected domination in graphs},
  author={J. Dunbar and J. Grossman and J. Hattingh and S. Hedetniemi and Alice A. McRae},
  journal={Discret. Math.},
  year={1997},
  volume={167-168},
  pages={261-269}
}
  • J. Dunbar, J. Grossman, +2 authors Alice A. McRae
  • Published 1997
  • Computer Science, Mathematics
  • Discret. Math.
  • A dominating set D is a weakly connected dominating set of a connected graph G=(V,E) if (V,E@?(DxV)) is connected. The weakly connected domination number of G, denoted @c"w"c(G), is min{|S||S is a weakly connected dominating set of G}. We characterize graphs G for which @c(H)=@c"w"c(H) for every connected induced subgraph H of G, where @c is the domination number of a graph. We provide a constructive characterization of trees T for which @c(T)=@c"w"c(T). Lastly, we constructively characterize… CONTINUE READING
    67 Citations
    Weakly connected domination stable trees
    • 3
    • PDF
    Connected domination of regular graphs
    • 14
    • Highly Influenced
    • PDF
    On the number of edges in graphs with a given connected domination number
    • L. Sanchis
    • Computer Science, Mathematics
    • Discret. Math.
    • 2000
    • 15
    Lower bound on the weakly connected domination number of a cycle-disjoint graph
    • 3
    • PDF
    Weakly connected total domination in graphs
    • PDF
    Weakly connected Roman domination in graphs
    Weakly connected domination subdivision numbers
    • J. Raczek
    • Mathematics, Computer Science
    • Discuss. Math. Graph Theory
    • 2008
    • 2
    • PDF

    References

    SHOWING 1-10 OF 30 REFERENCES
    An induced subgraph characterization of domination perfect graphs
    • 48
    • PDF
    On domination and independent domination numbers of a graph
    • 211
    Dominating sets whose closed stars form spanning trees
    • J. Grossman
    • Computer Science, Mathematics
    • Discret. Math.
    • 1997
    • 8
    Contributions to the theory of domination, independence and irredundance in graphs
    • 100
    WELL-COVERED GRAPHS: A SURVEY
    • 115
    Using maximality and minimality conditions to construct inequality chains
    • 10
    • PDF
    Graph theory and combinatorics
    • 151
    Theory of Graphs
    • 1,423
    Some covering concepts in graphs
    • 180
    Computers and Intractability: A Guide to the Theory of NP-Completeness
    • 47,338
    • PDF