A characterization of strongly regular graphs in terms of the largest signless Laplacian eigenvalues

2016 ◽  
Vol 506 ◽  
pp. 1-5 ◽  
Author(s):  
Feng-lei Fan ◽  
Chih-wen Weng
2001 ◽  
Vol 50 (9) ◽  
pp. 984-985 ◽  
Author(s):  
A. Bernasconi ◽  
B. Codenottl ◽  
J.M. Vanderkam

1995 ◽  
Vol 52 (1-2) ◽  
pp. 91-100 ◽  
Author(s):  
Tung-Shan Fu ◽  
Tayuan Huang

10.37236/1529 ◽  
2000 ◽  
Vol 7 (1) ◽  
Author(s):  
M. A. Fiol

A graph $\Gamma$ with diameter $d$ is strongly distance-regular if $\Gamma$ is distance-regular and its distance-$d$ graph $\Gamma _d$ is strongly regular. The known examples are all the connected strongly regular graphs (i.e. $d=2$), all the antipodal distance-regular graphs, and some distance-regular graphs with diameter $d=3$. The main result in this paper is a characterization of these graphs (among regular graphs with $d$ distinct eigenvalues), in terms of the eigenvalues, the sum of the multiplicities corresponding to the eigenvalues with (non-zero) even subindex, and the harmonic mean of the degrees of the distance-$d$ graph.


2015 ◽  
Vol 92 (1) ◽  
pp. 482-486
Author(s):  
A. A. Makhnev ◽  
D. V. Paduchikh

2012 ◽  
Vol 119 (7) ◽  
pp. 1414-1426 ◽  
Author(s):  
Majid Behbahani ◽  
Clement Lam ◽  
Patric R.J. Östergård

Sign in / Sign up

Export Citation Format

Share Document