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.
机构:
Department of Mathematics and Computer Science, Morehead State University, Morehead, KY 40351, United KingdomDepartment of Mathematics and Computer Science, Morehead State University, Morehead, KY 40351, United Kingdom
Chatham, R. Douglas
Doyle, Maureen
论文数: 0引用数: 0
h-index: 0
机构:
Department of Computer Section, Northern Kentucky University, Highland Heights, KY 41099, United StatesDepartment of Mathematics and Computer Science, Morehead State University, Morehead, KY 40351, United Kingdom
Doyle, Maureen
Fricke, Gerd H.
论文数: 0引用数: 0
h-index: 0
机构:
Department of Mathematics and Computer Science, Morehead State University, Morehead, KY 40351, United KingdomDepartment of Mathematics and Computer Science, Morehead State University, Morehead, KY 40351, United Kingdom
Fricke, Gerd H.
Reitmann, Jon
论文数: 0引用数: 0
h-index: 0
机构:
Department of Mathematics and Computer Science, Morehead State University, Morehead, KY 40351, United KingdomDepartment of Mathematics and Computer Science, Morehead State University, Morehead, KY 40351, United Kingdom
Reitmann, Jon
Skaggs, R. Duane
论文数: 0引用数: 0
h-index: 0
机构:
Department of Mathematics and Computer Science, Morehead State University, Morehead, KY 40351, United KingdomDepartment of Mathematics and Computer Science, Morehead State University, Morehead, KY 40351, United Kingdom
Skaggs, R. Duane
Wolff, Matthew
论文数: 0引用数: 0
h-index: 0
机构:
Pyramid Controls Inc., Cincinnati, OH 45203, United StatesDepartment of Mathematics and Computer Science, Morehead State University, Morehead, KY 40351, United Kingdom
Wolff, Matthew
Journal of Combinatorial Mathematics and Combinatorial Computing,
2009,
68
: 3
-
17