Proof of a conjecture on the nullity of a graph
- 20 May 2020
- journal article
- research article
- Published by Wiley in Journal of Graph Theory
- Vol. 95 (4) , 586-593
Abstract
Let 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.Keywords
Funding Information
- National Natural Science Foundation of China (11701008)
- China Postdoctoral Science Foundation (2019M660148)
- Natural Science Foundation of Anhui Province (1808085QA04)
This publication has 30 references indexed in Scilit:
- On the relation between theH-rank of a mixed graph and the matching number of its underlying graphLinear and Multilinear Algebra, 2017
- A characterization of graphs with rank 5Linear Algebra and its Applications, 2012
- On the nullity of a graph with cut-pointsLinear Algebra and its Applications, 2012
- Spectra of Graphs2012
- A characterization of graphs with rank 4Linear Algebra and its Applications, 2011
- On the nullity of bipartite graphsLinear Algebra and its Applications, 2009
- On the nullity of graphsThe Electronic Journal of Linear Algebra, 2007
- Trees with maximum nullityLinear Algebra and its Applications, 2005
- Algebraic Graph Theory2001
- Spektren endlicher grafenAbhandlungen aus dem Mathematischen Seminar der Universitat Hamburg, 1957