Random procedures for dominating sets in bipartite graphs

Artmann, Sarah GND; Harant, Jochen GND

Using multilinear functions and random procedures, new upper bounds on the domination number of a bipartite graph in terms of the cardinalities and the minimum degrees of the two colour classes are established.

Cite

Citation style:

Artmann, Sarah / Harant, Jochen: Random procedures for dominating sets in bipartite graphs. 2010.

Access Statistic

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

open graphic

Rights

Use and reproduction:

Export