The outer-connected domination number of a graph

@article{Cyman2007TheOD,
  title={The outer-connected domination number of a graph},
  author={Joanna Cyman},
  journal={Australasian J. Combinatorics},
  year={2007},
  volume={38},
  pages={35-46}
}
For a given graph G = (V,E), a set D ⊆ V (G) is said to be an outerconnected dominating set if D is dominating and the graph G−D is connected. The outer-connected domination number of a graph G, denoted by γ̃c(G), is the cardinality of a minimum outer-connected dominating set of G. We study several properties of outer-connected dominating sets and give some bounds on the outer-connected domination number of a graph. We also show that the decision problem for the outer-connected domination… CONTINUE READING

From This Paper

Topics from this paper.
12 Citations
0 References
Similar Papers

Similar Papers

Loading similar papers…