Proof of a conjecture on the nullity of a connected graph in terms of order and maximum degree
From MaRDI portal
Publication:2174420
DOI10.1016/j.laa.2019.11.011zbMath1437.05133OpenAlexW2986193923WikidataQ123004888 ScholiaQ123004888MaRDI QIDQ2174420
Muhuo Liu, Bo Cheng, Bo Lian Liu
Publication date: 21 April 2020
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2019.11.011
Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Connectivity (05C40) Vertex degrees (05C07)
Related Items (6)
On connected graphs of order \(n\) with girth \(g\) and nullity \(n-g\) ⋮ Graphs \(G\) with nullity \(n(G) - g(G) -1\) ⋮ On connected signed graphs with rank equal to girth ⋮ A short proof of Zhou, Wong and Sun's conjecture ⋮ From the editor-in-chief ⋮ On the nullity of a connected graph in terms of order and maximum degree
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Characterization of graphs with given order, given size and given matching number that minimize nullity
- A characterization of graphs with rank 5
- A characterization of graphs \(G\) with nullity \(|V(G)|-2m(G)+2c(G)\)
- A characterization of graphs with rank 4
- On the nullity of tricyclic graphs
- On the nullity of a graph with cut-points
- Spektren endlicher Grafen
- On the nullity and the matching number of unicyclic graphs
- On the nullity of bicyclic graphs
- An upper bound of the nullity of a graph in terms of order and maximum degree
- Trees with maximum nullity
- Nullities of graphs with given order, matching number and cyclomatic number revisited
- On the nullity of unicyclic graphs
- Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank
- On the nullity of graphs
- On the nullity of graphs with pendant trees
- The extremal graphs with respect to their nullity
This page was built for publication: Proof of a conjecture on the nullity of a connected graph in terms of order and maximum degree
