Domination in graphs with minimum degree two.(English)Zbl 0708.05058

The domination number $$\gamma$$ (G) of a graph $$G=(V,E)$$ is the minimum cardinality of a subset of V such that every vertex is either in the set or is adjacent to some vertex in the set. The authors show that if a connected graph G has minimum degree two and is not one of seven exceptional graphs, then $$\gamma$$ (G)$$\leq 2| V| /5$$. They also characterize those graphs with $$\gamma (G)=2| V| /5$$.
Reviewer: D.Lick

MSC:

 05C99 Graph theory
Full Text:

References:

 [1] private communication. [2] private communication. [3] Theory of Graphs. American Mathematics Society, Colloquium Publications Vol. 38, American Mathematics Society, Providence, RI (1962). [4] Payan, Cahier du C.E.R.O. 17 (1975) [5] Sur quelques problèmes de couverture et de couplage en combinatoire. Thèse Grenoble (1977). [6] Cockayne, J. Graph Theory 9 pp 533– (1985)
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.