Abstract
AbstractLet be a finite undirected graph without loops and multiple edges. The nullity of , written as , is defined to be the multiplicity of 0 as an eigenvalue of its adjacency matrix. The left problem of establishing an upper bound for an arbitrary graph in terms of order and maximum degree was recently solved by Zhou et al. Zhou et al proved that for an arbitrary graph without isolated vertices and with order , with maximum degree , the equality holds if and only if is the disjoint union of some copies of , and they posed a conjecture: If is assumed to be connected, the upper bound of can be improved to , and the upper bound is attained if and only if is a cycle with divisible by 4 or a complete bipartite graph with equal size of chromatic sets. The goal of the present paper is to give a proof confirming the conjecture.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
