Domination in bipartite graphs

Harant, Jochen GND; Rautenbach, Dieter GND

We prove that the domination number of a graph of order n and minimum degree at least 2 that does not contain cycles of lengths 4, 5, 7, 10 or 13 is at most 3 8n. Furthermore, we derive upper bounds on the domination number of bipartite graphs of given minimum degree

Cite

Citation style:
Harant Prof. Dr. rer. nat. habil., J., Rautenbach Prof. Dr. rer. nat. habil., D., 2007. Domination in bipartite graphs. Preprint /  Technische Universität Ilmenau, Institut für Mathematik, Preprint /  Technische Universität Ilmenau, Institut für Mathematik 07–08.
Could not load citation form. Default citation form is displayed.

Rights

Use and reproduction:
All rights reserved

Export