Dominating sets for split and bipartite graphs
References (19)
- et al.
On domination and independent domination numbers of a graph
Discrete Math.
(1978) - et al.
Contributions to the theory of domination, independence and irredundance in graphs
Discrete Math.
(1981) - et al.
A linear algorithm for the domination number of a tree
Inform. Process. Lett.
(1975) - et al.
Disjoint independent dominating sets in graphs
Discrete Math.
(1976) - et al.
Optimal domination in weighted trees
Inform. Process. Lett.
(1978) Graphs and Hypergraphs
(1973)- et al.
Graph-theoretic parameters concerning domination, independence, and irredundance
J. Graph Theory
(1979) Dominating sets and domatic number of circular arc graphs
(1980)- et al.
Dominating sets in chordal graphs
SIAM J. Comput.
(1982)
There are more references available in the full text version of this article.
Cited by (0)
- ∗
This research was financially supported by a Grant from the Ministero della Pubblica Istruzione of Italy.
Copyright © 1984 Published by Elsevier B.V.