INDEPENDENT DOMINATION IN REGULAR GRAPHS

被引：19

作者：

HAVILAND, J ^{[1
]}

机构：

[1] UNIV EXETER,SCH ENGN,EXETER EX4 4QF,DEVON,ENGLAND

来源：

DISCRETE MATHEMATICS | 1995年 / 143卷 / 1-3期

关键词：

D O I：

10.1016/0012-365X(94)00022-B

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Let G be a simple graph of order n. The independent domination number i(G) is defined to be the minimum cardinality among all maximal independent sets of vertices of G. Motivated by work of Cockayne et al. (1991) and Cockayne and Mynhardt (1989), we investigate the maximum value of the product of the independent domination numbers of a graph and its complement, as a function of n. In particular we prove that if G is regular then i(G) . i((G) over bar) < (n + 14)(2)/12.68.

引用

页码：275 / 280

页数：6

共 7 条

[1] THE PRODUCT OF THE INDEPENDENT DOMINATION NUMBERS OF A GRAPH AND ITS COMPLEMENT [J].