On Connected Graphs with Distance Eigenvalue −1 of Multiplicity at Least n−4 (Q6072084)
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: On Connected Graphs with Distance Eigenvalue −1 of Multiplicity at Least n−4 |
scientific article; zbMATH DE number 7771766
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On Connected Graphs with Distance Eigenvalue −1 of Multiplicity at Least n−4 |
scientific article; zbMATH DE number 7771766 |
Statements
On Connected Graphs with Distance Eigenvalue −1 of Multiplicity at Least n−4 (English)
0 references
29 November 2023
0 references
distance hereditary graph
0 references
distance spectrum
0 references
canonical graph
0 references
primitive graph
0 references
0.8879300951957703
0 references
0.8845733404159546
0 references
0.8746962547302246
0 references
0.8614118099212646
0 references
0.8565099835395813
0 references
