Constructing graphs with given spectrum and the spectral radius at most 2 (Q501283)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Constructing graphs with given spectrum and the spectral radius at most 2 |
scientific article; zbMATH DE number 6668953
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Constructing graphs with given spectrum and the spectral radius at most 2 |
scientific article; zbMATH DE number 6668953 |
Statements
Constructing graphs with given spectrum and the spectral radius at most 2 (English)
0 references
29 December 2016
0 references
adjacency spectrum
0 references
cospectral graphs
0 references
DS-graph
0 references
cospectral equivalence class
0 references
Diophantine equation
0 references
0 references
0 references
0.90803087
0 references
0.9023155
0 references
0.8983011
0 references
0.89223254
0 references
0 references
0 references
0.89014876
0 references
0.8893914
0 references
0 references
