An algorithm for constructing graphs with given eigenvalues and angles (Q2724006)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 1615332
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithm for constructing graphs with given eigenvalues and angles |
scientific article; zbMATH DE number 1615332 |
Statements
8 July 2001
0 references
graph spectra
0 references
graph angles
0 references
construction algorithm
0 references
0.8993051
0 references
0 references
0.86478984
0 references
0 references
0.8538076
0 references
0.8528343
0 references
0 references
An algorithm for constructing graphs with given eigenvalues and angles (English)
0 references
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.
0 references
