A simpler sharp lower bound for nullity of a bipartite graph

DOI10.18311/JIMS/2025/36147MaRDI QIDQ7229937zbMATH OpenFDO

Authors Ram Asrey Rajput

Publication date 17 April 2026

Published in The Journal of the Indian Mathematical Society. New Series (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

bipartite graphnullity

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Chemical graph theory (05C92)

Cites work

• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• scientific article; zbMATH DE number 3377258 (Why is no real title available?)
• An improved lower bound for the nullity of a graph in terms of matching number
• Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank
• Nullity of graphs: an updated survey
• On the nullity of bipartite graphs
• On the nullity of bipartite graphs
• On the nullity of graphs
• Some elementary lower bounds on the matching number of bipartite graphs
• Spektren endlicher Grafen
• Upper bounds for the largest eigenvalues of a bipartite graph

This page was built for publication: A simpler sharp lower bound for nullity of a bipartite graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7229937)