Eigenvalues, eigenspaces and distances to subsets (Q1356741): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claims |
||
| Property / author | |||
| Property / author: Charles Delorme / rank | |||
| Property / author | |||
| Property / author: Jean-Pierre Tillich / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Dragos Cvetković / rank | |||
Revision as of 18:49, 10 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Eigenvalues, eigenspaces and distances to subsets |
scientific article |
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
