摘要

Let gamma(G) and beta(G) denote the domination number and the vertex cover number of a graph G, respectively. We use g(gamma=beta) for the set of graphs which have equal domination number and vertex cover number. In this short note, we present a characterization for the class g(gamma=beta).