Eigenvalue multiplicity of graphs with given cyclomatic number and given number of quasi-pendant vertices
From MaRDI portal
Publication:6202934
Recommendations
- The multiplicity of an arbitrary eigenvalue of a graph in terms of cyclomatic number and number of pendant vertices
- A characterization for a graph with an eigenvalue of multiplicity \(2c(G)+p(G) - 1\)
- A characterization of trees with eigenvalue multiplicity one less than their number of pendant vertices
- The eigenvalue multiplicity of line graphs
- Graphs with eigenvalue \(-1\) of multiplicity \(2 \theta (G)+ \rho (G) -1\)
Cites work
- A note on the multiplicities of the eigenvalues of a tree
- Graphs \(G\) with nullity \(2c(G) + p(G) - 1\)
- Graphs with eigenvalue \(-1\) of multiplicity \(2 \theta (G)+ \rho (G) -1\)
- Graphs with nullity \(2c(G)+p(G)-1\)
- Nullity of a graph in terms of the dimension of cycle space and the number of pendant vertices
- On multiple eigenvalues of trees
- On the multiplicity of \(-1\) as an eigenvalue of a tree with given number of pendant vertices
- On the multiplicity of eigenvalues of trees
- On the multiplicity of positive eigenvalues of a graph
- The Parter--Wiener Theorem: Refinement and Generalization
- The leaf-free graphs with nullity \(2 c ( G ) - 1\)
- The multiplicity of an arbitrary eigenvalue of a graph in terms of cyclomatic number and number of pendant vertices
- The multiplicity of eigenvalues of trees
- The nullity of bicyclic graphs in terms of their matching number
This page was built for publication: Eigenvalue multiplicity of graphs with given cyclomatic number and given number of quasi-pendant vertices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6202934)