• DOI:10.1016/S0012-365X(96)00233-6
Corpus ID: 715600

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

View via Publisher

doi.org

Save to Library

Create Alert

Cite

Launch Research Feed