Eigenvalues, eigenspaces and distances to subsets (Q1356741)
From MaRDI portal
!
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 1019093
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Eigenvalues, eigenspaces and distances to subsets |
scientific article; zbMATH DE number 1019093 |
Statements
Eigenvalues, eigenspaces and distances to subsets (English)
0 references
22 January 1998
0 references
The authors show how to improve certain, previously known, graph eigenvalues based calculations yielding upper bounds for the diameter of a vertex-transitive graph. Also upper bounds for the covering radius of error-correcting codes are derived.
0 references
eigenvalues
0 references
diameter
0 references
vertex-transitive graph
0 references
covering radius
0 references
error-correcting codes
0 references
0 references
0.8436342477798462
0 references
0.7881500124931335
0 references
0.7667309641838074
0 references
