Independence numbers of graphs-an extension of the Koenig-Egervary theorem

Let G be an arbitrary finite, undirected graph with no loops nor multiple edges. In this paper the inequality @b"0=