On graphs having domination number half their order
- Cite this article as:
- Fink, J.F., Jacobson, M.S., Kinch, L.F. et al. Period Math Hung (1985) 16: 287. doi:10.1007/BF01848079
- 51 Downloads
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.