Title
Factor Domination In Graphs
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. © 1991, Elsevier Inc. All rights reserved.
Publication Date
1-1-1991
Publication Title
Annals of Discrete Mathematics
Volume
48
Issue
C
Number of Pages
127-136
Document Type
Article
Personal Identifier
scopus
DOI Link
https://doi.org/10.1016/S0167-5060(08)71044-6
Copyright Status
Unknown
Socpus ID
77957091659 (Scopus)
Source API URL
https://api.elsevier.com/content/abstract/scopus_id/77957091659
STARS Citation
Brigham, Robert C. and Dutton, Ronald D., "Factor Domination In Graphs" (1991). Scopus Export 1990s. 1298.
https://stars.library.ucf.edu/scopus1990/1298