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, Jochen / Rautenbach, Dieter: Domination in bipartite graphs. 2007.

Access Statistic

Total:
Downloads:
Abtractviews:
Last 12 Month:
Downloads:
Abtractviews:

open graphic

Rights

Use and reproduction:
All rights reserved

Export