An algorithm for constructing graphs with given eigenvalues and angles
From MaRDI portal
A branch and bound algorithm for constructing graphs with given eigenvalues and angles between eigenspaces and coordinate axes of the corresponding real vector space is given in this paper. The algorithm is based on a result by the reviewer [Ars Comb. 29A, 179-187 (1990; Zbl 0726.05048)] which provides a supergraph of the graph under construction.
Recommendations
- scientific article; zbMATH DE number 4198034
- Construction of graphs with distinct eigenvalues
- Construction of graphs with exactly \(k\) main eigenvalues
- Locating eigenvalues in graphs. Algorithms and applications
- scientific article; zbMATH DE number 850069
- scientific article; zbMATH DE number 2149403
- Eigenvalues and triangles in graphs
- On the eigenvalues of \(A_\alpha \)-matrix of graphs
- Eigenvalues and the degree sequences of graphs
- On graphs with given main eigenvalues
Cited in
(5)- Constructing trees with given eigenvalues and angles
- Constructing fullerene graphs from their eigenvalues and angles
- scientific article; zbMATH DE number 4174971 (Why is no real title available?)
- scientific article; zbMATH DE number 4198034 (Why is no real title available?)
- scientific article; zbMATH DE number 32145 (Why is no real title available?)
This page was built for publication: An algorithm for constructing graphs with given eigenvalues and angles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2724006)
