@article{Harary_Haynes_Lewinter_2018, title={On the codomination number of a graph}, volume={12}, url={https://www.revistaproyecciones.cl/index.php/proyecciones/article/view/2634}, DOI={10.22199/S07160917.1993.0002.00005}, abstractNote={<p>Given a graph G = (V, E), set S ? V is a dominating set if each node of V - S is adjacent to at least one node in S. The domination number of G is the smallest size of a dominating set and the codomination number is the domination number of its complement. We determine the codomination number of a graph having diameter at least three. Further we explore the effects of this result on the open problem of characterizing graphs having equal domination and codomination numbers.</p>}, number={2}, journal={Proyecciones (Antofagasta, On line)}, author={Harary, Frank and Haynes, Teresa W. and Lewinter, Martin}, year={2018}, month={Apr.}, pages={149-153} }