Abstract
In this paper we present a characterization of connected graphs of order 2n with domination numbern. Using this class of graphs, we determine an infinite class of graphs with the property that the domination number of the product of any two is precisely the product of the domination numbers.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M. Behzad, G. Chartrand andL. M. Lesniak-Foster,Graphs & digraphs, Prindle, Weber & Schmidt, Boston, 1979.MR 80f: 05019
E. J. Cockayne, Domination of indirected graphs — A survey,Theory and Applications of Graphs (Proc. Conf., Kalamazoo, 1976), Springer, Berlin, 1978; 141–147.MR 80g: 05036
E. J. Cockayne andS. Hedetniemi, Towards a theory of domination in graphs,Networks 7 (1977), 247–261.MR 80i: 05054
M. S. Jacobson andL. F. Kinch, On the domination number of products of graphs, I,Ars Comb. 18 (1984), 33–44.
V. G. Vizing, Ocenka čisla vnešnei ustoičivosti grafa (An estimate of the external stability number of a graph),Dokl. Akad. Nauk SSSR 164 (1965), 729–731.MR 32: 5547
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Fink, J.F., Jacobson, M.S., Kinch, L.F. et al. On graphs having domination number half their order. Period Math Hung 16, 287–293 (1985). https://doi.org/10.1007/BF01848079
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01848079