New Bounds on Domination and Independence in Graphs1

被引:0
|
作者
Harant, Jochen [1 ]
Mohr, Samuel [1 ,2 ]
机构
[1] TU Ilmenau, Inst Math, D-98684 Ilmenau, Germany
[2] Masaryk Univ, Fac Informat, Brno 60200, Czech Republic
关键词
undirected graph; domination number; independence number; bounds; NUMBER;
D O I
10.7151/dmgt.2406
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We propose new bounds on the domination number and on the independence number of a graph and show that our bounds compare favorably to recent ones. Our bounds are obtained by using the Bhatia-Davis inequality linking the variance, the expected value, the minimum, and the maximum of a random variable with bounded distribution.
引用
收藏
页码:809 / 824
页数:16
相关论文
共 50 条