Diameter, covering index, covering radius and eigenvalues (Q1174153): Difference between revisions

An upper bound for the diameter of a regular graph in terms of the second largest eigenvalue (in absolute value) by \textit{F. R. K. Chung} [J. Am. Math. Soc. 2, No. 2, 187-195 (1989; Zbl 0678.05037)] has been generalized to the case of biregular graphs and regular directed graphs. The authors also discuss connections to finite nonabelian simple groups, primitive association schemes, primitivity exponent of the adjacency matrix, covering radius of a linear code and Cayley graphs.