Recommendations
Cited in
(29)- Proof of a conjecture on the nullity of a graph
- Characterization of graphs with given order, given size and given matching number that minimize nullity
- On the multiplicity of \(-1\) as an eigenvalue of a tree with given number of pendant vertices
- A characterization of graphs with rank 5
- On the nullity of the line graph of unicyclic graph with depth one
- An upper bound of the nullity of a graph in terms of order and maximum degree
- On \((k+1)\)-line graphs of \(k\)-trees and their nullities
- A characterization of graphs with rank 4
- Nullity and singularity of a graph in which every block is a cycle
- The positive and the negative inertia index of line graphs of trees
- On the nullity of bipartite graphs
- On the nullity of a family of tripartite graphs
- On the multiplicity of an arbitrary \(A_\alpha\)-eigenvalue of a connected graph
- The multiplicity of an arbitrary eigenvalue of a graph in terms of cyclomatic number and number of pendant vertices
- Line graphs of trees with the largest eigenvalue multiplicity
- Trees with maximum nullity
- Nullity of a graph in terms of path cover number
- On the nullity number of graphs
- A characterization of long graphs of arbitrary rank
- Bounds of nullity for complex unit gain graphs
- Nullity of a graph in terms of the dimension of cycle space and the number of pendant vertices
- Characterization of graphs whose signature equals the number of odd cycles
- On the nullity of graphs with pendent vertices
- Maximum Estrada index of bicyclic graphs
- Characterizing Graphs with Nullity n-4
- Null decomposition of trees
- A lower bound for graph energy
- Tree composition condition and moments vanishing
- An improved lower bound for the nullity of a graph in terms of matching number
This page was built for publication: On the trees with maximum nullity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5424660)
