Set domination in graphs. (English) Zbl 0807.05066

For a connected graph \(G\) the authors introduce the concept of set domination. A set \(D\subset V(G)\) is called set-dominating set if for every set \(T\subset V- D\), there exists a nonempty set \(S\subset D\) such that the induced subgraph \(S\cup T\) of \(G\) is connected. In this paper some result on this topic are proved.
Reviewer: M.Hager (Leonberg)


05C99 Graph theory
05C35 Extremal problems in graph theory
05C40 Connectivity
Full Text: DOI


[1] Cockayne, Networks 7 pp 247– (1977)
[2] and , Connected domination in graphs. Graph Theory and Combinatorics. Academic Press, London (1984) 209–218.
[3] and , On domination related topics in graph theory. Combinatorics and Graph Theory, Calcutta (1980), Lecture Notes in Mathematics, Vol. 885, Springer-Verlag, Berlin, (1981) 308–320.
[4] Newman-Wolfe, Congres. Numer. 67 pp 67– (1988)
[5] Nieminen, J. Inst. Math. Applic. 14 pp 183– (1974)
[6] Sampathkumar, J. Math. Phy. Sci. 13 pp 607– (1979)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.