A sharp upper bound of the nullity of a connected graph in terms of order and maximum degree
From MaRDI portal
Publication:2332433
Recommendations
- Proof of a conjecture on the nullity of a connected graph in terms of order and maximum degree
- On the nullity of a connected graph in terms of order and maximum degree
- An upper bound of the nullity of a graph in terms of order and maximum degree
- A short proof of Zhou, Wong and Sun's conjecture
- On the nullity of graphs
Cites work
- scientific article; zbMATH DE number 3717357 (Why is no real title available?)
- scientific article; zbMATH DE number 540115 (Why is no real title available?)
- scientific article; zbMATH DE number 5578782 (Why is no real title available?)
- scientific article; zbMATH DE number 3414355 (Why is no real title available?)
- A characterization of graphs \(G\) with nullity \(|V(G)|-2m(G)+2c(G)\)
- A characterization of graphs with rank 4
- A characterization of graphs with rank 5
- An introduction to the theory of graph spectra
- An upper bound of the nullity of a graph in terms of order and maximum degree
- Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank
- Characterization of graphs with given order, given size and given matching number that minimize nullity
- Chromatic number and the 2-rank of a graph
- Graph theory
- On graphs with multiple eigenvalues
- On the construction of graphs of nullity one
- On the nullity of a graph with cut-points
- On the nullity of line graphs of trees
- Spektren endlicher Grafen
- The rank and size of graphs
Cited in
(16)- On connected graphs of order n with girth g and nullity n-g
- Proof of a conjecture on the nullity of a graph
- An upper bound of the nullity of a graph in terms of order and maximum degree
- From the editor-in-chief
- Maximum generic nullity of a graph
- A short proof of Zhou, Wong and Sun's conjecture
- Proof of a conjecture on the nullity of a connected graph in terms of order and maximum degree
- The gap between the rank of a complex unit gain graph and its underlying graph
- On connected signed graphs with rank equal to girth
- On the nullity of a connected graph in terms of order and maximum degree
- Singular graphs with dicyclic or semi-dihedral group action
- scientific article; zbMATH DE number 7692350 (Why is no real title available?)
- On a relationship between the characteristic and matching polynomials of a uniform hypertree
- Characterizing Graphs with Nullity n-4
- Bounds for zero forcing numbers of connected graphs with fixed order and maximum degree
- On bounds of \(A_\alpha\)-eigenvalue multiplicity and the rank of a complex unit gain graph
This page was built for publication: A sharp upper bound of the nullity of a connected graph in terms of order and maximum degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2332433)
