Constructing trees with given eigenvalues and angles
From MaRDI portal
Publication:1124609
DOI10.1016/0024-3795(88)90002-XzbMath0679.05053OpenAlexW2017344556MaRDI QIDQ1124609
Publication date: 1988
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(88)90002-x
Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items
A study of eigenspaces of graphs, Which graphs are determined by their spectrum?, On the power of combinatorial and spectral invariants, Constructing fullerene graphs from their eigenvalues and angles
Cites Work
