Factor Domination In Graphs
Abbreviated Journal Title
Given a factoring of a graph, the factor domination number gamma-f is the smallest number of nodes which dominate all factors. General results, mainly involving bounds on gamma-f for factoring of arbitrary graphs, are presented, and some of these are generalizations of well known relationships. The special case of two-factoring K(p) into a graph G and its complement GBAR receives special emphasis.
"Factor Domination In Graphs" (1990). Faculty Bibliography 1990s. 17.