The \(H\)-join of arbitrary families of graphs -- the universal adjacency spectrum (Q2144241)
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: The H-join of arbitrary families of graphs -- the universal adjacency spectrum |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The \(H\)-join of arbitrary families of graphs -- the universal adjacency spectrum |
scientific article |
Statements
The \(H\)-join of arbitrary families of graphs -- the universal adjacency spectrum (English)
0 references
1 June 2022
0 references
graph operations
0 references
walk-matrix
0 references
graph eigenvalues
0 references
universal adjacency matrix
0 references
0.8166542649269104
0 references
0.8094288110733032
0 references
0.8088081479072571
0 references
0.8054968118667603
0 references
0.7965962886810303
0 references
