Title of article
Domination in bipartite graphs
Author/Authors
Harant، نويسنده , , Jochen and Rautenbach، نويسنده , , Dieter، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
10
From page
113
To page
122
Abstract
We prove that the domination number of a graph of order n and minimum degree at least 2 that does not contain cycles of length 4, 5, 7, 10 or 13 is at most 3 8 n . Furthermore, we derive upper bounds on the domination number of bipartite graphs of given minimum degree.
Keywords
Cycle length , bipartite , Probabilistic method , Domination number
Journal title
Discrete Mathematics
Serial Year
2009
Journal title
Discrete Mathematics
Record number
1598469
Link To Document