Proof of a conjecture on the nullity of a connected graph in terms of order and maximum degree
From MaRDI portal
(Redirected from Publication:2174420)
Recommendations
- A sharp upper bound of the nullity of a connected graph in terms of order and maximum degree
- A short proof of Zhou, Wong and Sun's conjecture
- 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
- An upper bound for the nullity of a bipartite graph in terms of its maximum degree
Cites work
- scientific article; zbMATH DE number 540115 (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 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
- Nullities of graphs with given order, matching number and cyclomatic number revisited
- On the characterization of graphs with pendent vertices and given nullity
- On the nullity and the matching number of unicyclic graphs
- On the nullity of a graph with cut-points
- On the nullity of bicyclic graphs
- On the nullity of graphs
- On the nullity of graphs with pendant trees
- On the nullity of tricyclic graphs
- On the nullity of unicyclic graphs
- Spektren endlicher Grafen
- The extremal graphs with respect to their nullity
- Trees with maximum nullity
Cited in
(9)- 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
- A short proof of Zhou, Wong and Sun's conjecture
- Graphs \(G\) with nullity \(n(G) - g(G) -1\)
- A sharp upper bound of the nullity of a connected graph in terms of order and maximum degree
- On connected signed graphs with rank equal to girth
- On the nullity of a connected graph in terms of order and maximum degree
This page was built for publication: Proof of a conjecture on 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 Q2174420)