Constructing trees with given eigenvalues and angles

DOI10.1016/0024-3795(88)90002-XzbMATH Open0679.05053OpenAlexW2017344556MaRDI QIDQ1124609FDOQ1124609

Authors: Dragoš Cvetković 

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

Recommendations

• An algorithm for constructing graphs with given eigenvalues and angles
• Construction of acyclic matrices from spectral data
• scientific article; zbMATH DE number 4174971
• scientific article; zbMATH DE number 4198034
• Some trees characterized by eigenvalues and angles

zbMATH Keywords

graphseigenvaluestreesreconstruction problemangles between eigensubspaces

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Developments in the theory of graph spectra

Cited In (11)

• Tree decomposition by eigenvectors
• Constructions of graphs and trees with partially prescribed spectrum
• On the power of combinatorial and spectral invariants
• Which graphs are determined by their spectrum?
• Constructing fullerene graphs from their eigenvalues and angles
• Locating the eigenvalues of trees
• Implicit construction of multiple eigenvalues for trees
• Title not available (Why is that?)
• A study of eigenspaces of graphs
• Reconstruction from one labelled card and more
• Some trees characterized by eigenvalues and angles

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)