Graphs whose distance matrix has at most three negative eigenvalues (Q2013202)
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: Graphs whose distance matrix has at most three negative eigenvalues |
scientific article; zbMATH DE number 6756345
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Graphs whose distance matrix has at most three negative eigenvalues |
scientific article; zbMATH DE number 6756345 |
Statements
Graphs whose distance matrix has at most three negative eigenvalues (English)
0 references
3 August 2017
0 references
distance matrix
0 references
\(D\)-eigenvalue
0 references
negative inertia
0 references
0.94835794
0 references
0.9471681
0 references
0.9269242
0 references
0.9181554
0 references
0 references
0.91073036
0 references
0.9106325
0 references
