A Simpler Sharp Lower Bound for Nullity of a Bipartite Graph
The nullity of a graph is the multiplicity of the eigenvalue zero in its spectrum. For a simple undirected bipartite graph G = (V,E) with bipartition of the vertex set V = X ∪Y, such that |X| = p,|Y| = q and p ≤q. We give a lower bound to the nullity of graph G as η(G) ≥ q−p+2(δY(G)−1), where δY (G) is the minimum vertex degree of bipartition set Y. We obtain some more lower bounds for the nullity of a bipartite graph.