Domination in bipartite graphs |
| |
| Authors: | Jochen Harant |
| |
| Affiliation: | Institut für Mathematik, TU Ilmenau, Postfach 100565, D-98684 Ilmenau, Germany |
| |
| 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  . Furthermore, we derive upper bounds on the domination number of bipartite graphs of given minimum degree. |
| |
| Keywords: | Domination number Cycle length Bipartite Probabilistic method |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
