FACTOR DOMINATION IN GRAPHS

被引：31

作者：

BRIGHAM, RC ^{[1
]}

DUTTON, RD ^{[1
]}

机构：

[1] UNIV CENT FLORIDA,DEPT COMP SCI,ORLANDO,FL 32816

来源：

DISCRETE MATHEMATICS | 1990年 / 86卷 / 1-3期

关键词：

D O I：

10.1016/0012-365X(90)90355-L

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

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.

引用

页码：127 / 136

页数：10