Some inequalities about connected domination number

被引：16

作者：

Bo, C ^{[1
]}

Liu, BL ^{[1
]}

机构：

[1] S CHINA NORMAL UNIV,DEPT MATH,GUANGZHOU 510361,PEOPLES R CHINA

来源：

DISCRETE MATHEMATICS | 1996年 / 159卷 / 1-3期

关键词：

D O I：

10.1016/0012-365X(95)00088-E

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Let G = (V,E) be a graph. In this note, gamma(c),ir,gamma,i,beta(0),Gamma,IR denote the connected domination number, the irredundance number, the domination number, the independent domination number, the independence number, the upper domination number and the upper irredundance number, respectively. We prove that gamma(c) less than or equal to 3 ir - 2 for a connected graph G. Thus, an open problem in Hedetniemi and Laskar (1984) discuss further some relations between gamma(c) and gamma,beta(0),Gamma,IR, respectively.

引用

页码：241 / 245

页数：5

共 8 条

[1] Allan R.B., 1978, PROCEEDING 9 SE C GR, P43
[2] A NOTE ON TOTAL DOMINATION
ALLAN, RB
LASKAR, R
HEDETNIEMI, S
[J]. DISCRETE MATHEMATICS, 1984, 49 (01) : 7 - 13
[3] [Anonymous], 1978, Canad. Math. Bull.
[4] GRAPH-THEORETIC PARAMETERS CONCERNING DOMINATION, INDEPENDENCE, AND IRREDUNDANCE
BOLLOBAS, B
COCKAYNE, EJ
[J]. JOURNAL OF GRAPH THEORY, 1979, 3 (03) : 241 - 249
[5] BONDY JA, 1976, GRAPH THEORY APPLICA
[6] COCKAYNE EJ, 1974, 5TH P SE C COMB GRAP, P471
[7] Duchet P., 1982, Ann. Discrete Math., V13, P71
[8] Hedetniemi S. T., 1984, Graph Theory and Combinatorics, P209

← 1 →