abstract
A set S of vertices of a graph G is dominating if each vertex x not in S is adjacent to some vertex in S, and is independent if no two vertices in S are adjacent. The domination number, γ(G), is the order of the smallest dominating set in G. The independence number, α(G), is the order of the largest independent set in G. In this paper we characterize bipartite graphs and block graphs G for which γ(G) = α(G).
Similar content being viewed by others
References
M. Borowiecki, On a minimaximal kernel of trees, Discuss. Math. 1 (1975) 3–6.
E. J. Cockayne, Domination of undirected graphs — a survey, In: Y. Alavi and D. R. Lick, eds., Theory and Applications of Graphs, Lecture Notes in Math. 642, Springer - Verlag,Berlin — Heidelberg — New York, 1978, 141–147.
E. J. Cockayne and S. Hedetniemi, Towards a theory of domination in graphs, Networks 7 (1977) 247–261.
J. F. Fink, M. S. Jacobson, L. F. Kinch, and J. Roberts, On graphs having domination number half their order, Period. Math. Hung. 16 (1985) 287–293.
F. Harary, Graph Theory, Addison - Wesley, Reading, Mass., 1969.
L. Szamkołowicz, Sur la classification des graphes en vue des propriétés de leurs noyaux, Prace Nauk. Inst. Mat. i Fiz. Teoret., Politech. Wrocław., Ser. Stud. Mater. 3 (1970) 15–21.
L. Szamkołowicz, Teoria grafów skończonych, Ossolineum, Wrocław, 1971.
Author information
Authors and Affiliations
Additional information
On leave from the Faculty of Applied Physics and Mathematics, Gdańsk Technical University, 11/12 Majakowskiego, 80-952 Gdańsk, Poland. Research supported by the Heinrich Herts Foundation.
Rights and permissions
About this article
Cite this article
Topp, J., Volkmann, L. On Domination and Independence Numbers of Graphs. Results. Math. 17, 333–341 (1990). https://doi.org/10.1007/BF03322468
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF03322468