Eigenvalues, eigenspaces and distances to subsets (Q1356741): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0012-365x(96)00168-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1994672138 / rank | |||
Normal rank | |||
Latest revision as of 08:38, 30 July 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
0 references
