A characterization of bent functions in terms of strongly regular graphs

2001 ◽  
Vol 50 (9) ◽  
pp. 984-985 ◽  
Author(s):  
A. Bernasconi ◽  
B. Codenottl ◽  
J.M. Vanderkam
Keyword(s):  
Bent Functions ◽  
Strongly Regular Graphs ◽  
Regular Graphs ◽  
Strongly Regular

scholarly journals Strongly regular graphs constructed from p-ary bent functions

2010 ◽  
Vol 34 (2) ◽  
pp. 251-266 ◽  
Author(s):  
Yeow Meng Chee ◽  
Yin Tan ◽  
Xian De Zhang
Keyword(s):  
Bent Functions ◽  
Strongly Regular Graphs ◽  
Regular Graphs ◽  
Strongly Regular

A characterization of two classes of strongly regular graphs

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

scholarly journals Quasi-Spectral Characterization of Strongly Distance-Regular Graphs

10.37236/1529 ◽  
2000 ◽  
Vol 7 (1) ◽  
Author(s):  
M. A. Fiol
Keyword(s):  
Harmonic Mean ◽  
Spectral Characterization ◽  
Strongly Regular Graphs ◽  
Regular Graphs ◽  
Strongly Regular ◽  
Distance Regular Graphs

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.

Sign in / Sign up

Export Citation Format

Share Document