Eigenvalue multiplicity of graphs with given cyclomatic number and given number of quasi-pendant vertices
From MaRDI portal
Publication:6202934
DOI10.1016/j.dam.2023.12.029MaRDI QIDQ6202934
Wenhao Zhen, Dein Wong, Yuanshuai Zhang
Publication date: 27 February 2024
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)
Cites Work
- Unnamed Item
- Nullity of a graph in terms of the dimension of cycle space and the number of pendant vertices
- On multiple eigenvalues of trees
- Graphs \(G\) with nullity \(2c(G) + p(G) - 1\)
- The multiplicity of eigenvalues of trees
- Graphs with nullity \(2c(G)+p(G)-1\)
- Graphs with eigenvalue \(-1\) of multiplicity \(2 \theta (G)+ \rho (G) -1\)
- A note on the multiplicities of the eigenvalues of a tree
- On the multiplicity of positive eigenvalues of a graph
- The leaf-free graphs with nullity \(2 c ( G ) - 1\)
- On the multiplicity of eigenvalues of trees
- The multiplicity of an arbitrary eigenvalue of a graph in terms of cyclomatic number and number of pendant vertices
- The Parter--Wiener Theorem: Refinement and Generalization
- On the multiplicity of −1 as an eigenvalue of a tree with given number of pendant vertices
This page was built for publication: Eigenvalue multiplicity of graphs with given cyclomatic number and given number of quasi-pendant vertices
