Constructing trees with given eigenvalues and angles
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3884178 (Why is no real title available?)
- scientific article; zbMATH DE number 3674136 (Why is no real title available?)
- scientific article; zbMATH DE number 3717357 (Why is no real title available?)
- scientific article; zbMATH DE number 3769666 (Why is no real title available?)
- scientific article; zbMATH DE number 3497926 (Why is no real title available?)
- scientific article; zbMATH DE number 3411062 (Why is no real title available?)
- Developments in the theory of graph spectra
Cited in
(11)- A study of eigenspaces of graphs
- Tree decomposition by eigenvectors
- Some trees characterized by eigenvalues and angles
- Which graphs are determined by their spectrum?
- Reconstruction from one labelled card and more
- Constructions of graphs and trees with partially prescribed spectrum
- Implicit construction of multiple eigenvalues for trees
- Locating the eigenvalues of trees
- Constructing fullerene graphs from their eigenvalues and angles
- On the power of combinatorial and spectral invariants
- scientific article; zbMATH DE number 4174971 (Why is no real title available?)
This page was built for publication: Constructing trees with given eigenvalues and angles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1124609)