A lower bound on the independence number of a graph in terms of degrees

Harant, Jochen GND; Schiermeyer, Ingo GND

For a connected and non-complete graph, a new lower bound on its independence number is proved. It is shown that this bound is realizable by the well known efficient algorithm MIN.

Cite

Citation style:
Could not load citation form.

Rights

Use and reproduction:

Export