# 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} }

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

#### Figures and Topics from this paper

#### Figures

67 Citations

Bounds relating the weakly connected domination number to the total domination number and the matching number

- Computer Science, Mathematics
- Discret. Appl. Math.
- 2009

1

Connected domination of regular graphs

- Computer Science, Mathematics
- Discret. Math.
- 2009

14 Highly Influenced- PDF

On the number of edges in graphs with a given connected domination number

- Computer Science, Mathematics
- Discret. Math.
- 2000

15

Lower bound on the weakly connected domination number of a cycle-disjoint graph

- Mathematics, Computer Science
- Australas. J Comb.
- 2010

3- PDF

Similarities and Differences Between the Vertex Cover Number and the Weakly Connected Domination Number of a Graph

- Computer Science
- Fundam. Informaticae
- 2017

ANALOGIES AND DISCREPANCIES BETWEEN THE VERTEX COVER NUMBER AND THE WEAKLY CONNECTED DOMINATION NUMBER OF A GRAPH

- 2013

Highly Influenced- PDF

Weakly connected domination subdivision numbers

- 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

- Computer Science, Mathematics
- J. Graph Theory
- 1995

48- PDF

On domination and independent domination numbers of a graph

- Computer Science, Mathematics
- Discret. Math.
- 1978

211

Dominating sets whose closed stars form spanning trees

- Computer Science, Mathematics
- Discret. Math.
- 1997

8

Contributions to the theory of domination, independence and irredundance in graphs

- Computer Science, Mathematics
- Discret. Math.
- 1981

100

Using maximality and minimality conditions to construct inequality chains

- Computer Science, Mathematics
- Discret. Math.
- 1997

10- PDF

Computers and Intractability: A Guide to the Theory of NP-Completeness

- Computer Science, Mathematics
- 1978

47,338- PDF