Periodica Mathematica Hungarica

, Volume 16, Issue 4, pp 287–293

On graphs having domination number half their order

  • J. F. Fink
  • M. S. Jacobson
  • L. F. Kinch
  • J. Roberts
Article

DOI: 10.1007/BF01848079

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

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.

AMS (MOS) subject classification (1980)

Primary 05C35 

Key words and phrases

Connected graphs domination number product of graphs 

Copyright information

© Akadémiai Kiadó 1985

Authors and Affiliations

  • J. F. Fink
    • 1
  • M. S. Jacobson
    • 1
  • L. F. Kinch
    • 1
  • J. Roberts
    • 1
  1. 1.Department of MathematicsUniversity of LouisvilleLouisvilleUSA

Personalised recommendations