Title of article
Bounds on the -domination number of a graph
Author/Authors
DeLaViٌa، نويسنده , , Ermelinda and Goddard، نويسنده , , Wayne and Henning، نويسنده , , Michael A. and Pepper، نويسنده , , Ryan and Vaughan، نويسنده , , Emil R.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2011
Pages
3
From page
996
To page
998
Abstract
The k -domination number of a graph is the cardinality of a smallest set of vertices such that every vertex not in the set is adjacent to at least k vertices of the set. We prove two bounds on the k -domination number of a graph, inspired by two conjectures of the computer program Graffiti.pc. In particular, we show that for any graph with minimum degree at least 2 k − 1 , the k -domination number is at most the matching number.
Keywords
k -domination , matching number , graph , independence number
Journal title
Applied Mathematics Letters
Serial Year
2011
Journal title
Applied Mathematics Letters
Record number
1527888
Link To Document