Publications of (and about) Paul Erdös
Autor: Erdös, Paul; Henning, Michael A.; Swart, Henda C.
Title: The smallest order of a graph with domination number equal to two and with every vertex contained in a Kn. (In English)
Source: Ars Comb. 35A, 217-223 (1993).
Review: A set D of vertices of a graph G is a dominating set of G if every vertex of V(G)-D is adjacent to some vertex of D. The domination number \gamma(G) of G is the minimum cardinality among all dominating sets of G. In this paper, for n \geq 2 an integer, the smallest order of a graph with domination number equal to two and with every vertex contained in a Kn is established.
Classif.: * 05C35 Extremal problems (graph theory)
Keywords: dominating set; domination number
© European Mathematical Society & FIZ Karlsruhe & Springer-Verlag