#### Title

On Graphs Having Equal Domination And Codomination Numbers

#### Abbreviated Journal Title

Util. Math.

#### Keywords

Mathematics, Applied; Statistics & Probability

#### Abstract

In a graph G = (V, E), a set S subset of V is a dominating set if each vertex of V - S is adjacent to at least one vertex in S. The domination number gamma(G) is the smallest order of a dominating set of G and the codomination number of G, written gamma(($) over bar), is the domination number of its complement. We investigate conditions under which graphs have equal domination and codomination numbers. In particular, we characterize graphs for which gamma(G) = gamma((G) over bar) = 2 and establish properties of graphs for which gamma(G) = gamma((G) over bar) greater than or equal to 3. Finally, we construct a family of graphs having gamma(G) = gamma((G) over bar).

#### Journal Title

Utilitas Mathematica

#### Volume

50

#### Publication Date

1-1-1996

#### Document Type

Article

#### Language

English

#### First Page

53

#### Last Page

64

#### WOS Identifier

#### ISSN

0315-3681

#### Recommended Citation

"On Graphs Having Equal Domination And Codomination Numbers" (1996). *Faculty Bibliography 1990s*. 1559.

https://stars.library.ucf.edu/facultybib1990/1559

## Comments

Authors: contact us about adding a copy of your work at STARS@ucf.edu