On the multiplicity of -1 as an eigenvalue of a tree with given number of pendant vertices
From MaRDI portal
(Redirected from Publication:5049197)
On the multiplicity of \(-1\) as an eigenvalue of a tree with given number of pendant vertices
On the multiplicity of \(-1\) as an eigenvalue of a tree with given number of pendant vertices
Recommendations
Cites work
- 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)\)
- An upper bound for the nullity of a bipartite graph in terms of its maximum degree
- Maths for chemistry. A chemist's toolkit of calculations
- Nullity of a graph in terms of the dimension of cycle space and the number of pendant vertices
- On the Faria's inequality for the Laplacian and signless Laplacian spectra: a unified approach
- On the multiplicity of as an A_()-eigenvalue of signed graphs with pendant vertices
- On the multiplicity of \(\alpha\) as an eigenvalue of \(A_\alpha(G)\) of graphs with pendant vertices
- On the nullity and the matching number of unicyclic graphs
- On the nullity of bipartite graphs
- On the nullity of graphs
- On the nullity of line graphs of trees
- On the nullity of unicyclic graphs
- On the trees with maximum nullity
- Permanental roots and the star degree of a graph
- Relation between the skew-rank of an oriented graph and the rank of its underlying graph
- The multiplicity of an arbitrary eigenvalue of a graph in terms of cyclomatic number and number of pendant vertices
- Trees with maximum nullity
Cited in
(9)- On multiple eigenvalues of trees
- Graphs with eigenvalue \(-1\) of multiplicity \(2 \theta (G)+ \rho (G) -1\)
- Line graphs of trees with the largest eigenvalue multiplicity
- A characterization of trees with eigenvalue multiplicity one less than their number of pendant vertices
- The eigenvalue multiplicity of line graphs
- Eigenvalue multiplicity of graphs with given cyclomatic number and given number of quasi-pendant vertices
- A characterization of graphs with two types of eigenvalue multiplicities equal to n - d - 1
- Eigenvalue multiplicity of a graph in terms of the number of external vertices
- A characterization for a graph with an eigenvalue of multiplicity \(2c(G)+p(G) - 1\)
This page was built for publication: On the multiplicity of \(-1\) as an eigenvalue of a tree with given number of pendant vertices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5049197)