| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4650203 | Discrete Mathematics | 2009 | 10 Pages |
Abstract
We prove that the domination number of a graph of order nn and minimum degree at least 2 that does not contain cycles of length 4, 5, 7, 10 or 13 is at most 38n. Furthermore, we derive upper bounds on the domination number of bipartite graphs of given minimum degree.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Jochen Harant, Dieter Rautenbach,