A note on the difference between the upper irredundance and independence numbers of a graph

被引:0
作者
Liu, HL [1 ]
Sun, L [1 ]
机构
[1] Beijing Inst Technol, Dept Math Appl, Beijing 100081, Peoples R China
关键词
independence number; upper irredundance number;
D O I
暂无
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Let G = (V, E) be a simple graph. Let alpha and IR be the independence number and upper irredundance number of G respectively. In this paper, we prove that for any graph G of order n with maximum degree Delta greater than or equal to 1, IR(G) - alpha(G) less than or equal to Delta-2/2Delta n. When Delta = 3, the result was conjectured by Rautenbach.
引用
收藏
页码:199 / 202
页数:4
相关论文
共 3 条