Factor Domination In Graphs

    Authors

    R. C. Brigham;R. D. Dutton

    Comments

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

    Abbreviated Journal Title

    Discret. Math.

    Keywords

    Mathematics

    Abstract

    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.

    Journal Title

    Discrete Mathematics

    Volume

    86

    Issue/Number

    1-3

    Publication Date

    1-1-1990

    Document Type

    Article

    Language

    English

    First Page

    127

    Last Page

    136

    WOS Identifier

    WOS:A1990EU57200013

    ISSN

    0012-365X

    Share

    COinS