Elsevier

Discrete Mathematics

Volume 86, Issues 1–3, 14 December 1990, Pages 127-136
Discrete Mathematics

Factor domination in graphs

https://doi.org/10.1016/0012-365X(90)90355-LGet rights and content
Under an Elsevier user license
open archive

Abstract

Given a factoring of a graph, the factor domination number γf is the smallest number of nodes which dominate all factors. General results, mainly involving bounds on γf for factoring of arbitrary graphs, are presented, and some of these are generalizations of well known relationships. The special case of two-factoring Kp into a graph G and its complement G receives special emphasis.

Cited by (0)