Spectral diameter estimates for \(k\)-regular graphs (Q1333236)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Spectral diameter estimates for \(k\)-regular graphs |
scientific article |
Statements
Spectral diameter estimates for \(k\)-regular graphs (English)
0 references
1994
0 references
An upper bound for the diameter of a regular graph, which depends on the second largest eigenvalue (in modulus) of the adjacency matrix and on the girth, is derived.
0 references
upper bound
0 references
diameter
0 references
regular graph
0 references
eigenvalue
0 references
adjacency matrix
0 references
girth
0 references
