A characterization of bipartite graphs with independence number half their order.
Lutz Volkmann · 2008
Let n(G) and α(G) be the order and the independence number of a graph G, respectively. If G is bipartite graph, then it is well-known and easy to see that α(G) ≥ n(G). In this paper we present a constructive 2 characterization of bipartite graphs G for which n(G) α(G) =. 2