On the characterization of graphs with pendent vertices and given nullity
From MaRDI portal
(Redirected from Publication:3559070)
Recommendations
Cited in
(19)- 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
- A characterization of graphs with rank 5
- An upper bound of the nullity of a graph in terms of order and maximum degree
- The positive and the negative inertia index of line graphs of trees
- Graphs with eigenvalue \(-1\) of multiplicity \(2 \theta (G)+ \rho (G) -1\)
- Proof of a conjecture on the nullity of a connected graph in terms of order and maximum degree
- The multiplicity of an arbitrary eigenvalue of a graph in terms of cyclomatic number and number of pendant vertices
- Nullity of a graph in terms of path cover number
- A characterization of long graphs of arbitrary rank
- 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 pendant trees
- On the nullity of graphs with pendent vertices
- Characterizing Graphs with Nullity n-4
- A note proving the nullity of block graphs is unbounded
- Singular Cayley graphs and p-blocks of finite groups
- Graphs \(G\) with nullity \(2c(G) + p(G) - 1\)
- An improved lower bound for the nullity of a graph in terms of matching number
This page was built for publication: On the characterization of graphs with pendent vertices and given nullity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3559070)
