scholarly journals On $Q$-polynomial distance-regular graphs $\Gamma$ with strongly regular graphs $\Gamma_2$ and $\Gamma_3$

2019 ◽  
Vol 16 ◽  
pp. 1385-1392
Author(s):  
I. N. Belousov ◽  
A. A. Makhnev ◽  
M. S. Nirova
Keyword(s):  
Strongly Regular Graphs ◽  
Regular Graphs ◽  
Strongly Regular ◽  
Distance Regular Graphs

scholarly journals Uniform Mixing and Association Schemes

10.37236/4745 ◽  
2017 ◽  
Vol 24 (3) ◽  
Author(s):  
Chris Godsil ◽  
Natalie Mullin ◽  
Aidan Roy
Keyword(s):  
Continuous Time ◽  
Hadamard Matrices ◽  
Quantum Walks ◽  
Association Schemes ◽  
Strongly Regular Graphs ◽  
Regular Graphs ◽  
Paley Graph ◽  
Time Quantum ◽  
Strongly Regular ◽  
Distance Regular Graphs

We consider continuous-time quantum walks on distance-regular graphs. Using results about the existence of complex Hadamard matrices in association schemes, we determine which of these graphs have quantum walks that admit uniform mixing.First we apply a result due to Chan to show that the only strongly regular graphs that admit instantaneous uniform mixing are the Paley graph of order nine and certain graphs corresponding to regular symmetric Hadamard matrices with constant diagonal. Next we prove that if uniform mixing occurs on a bipartite graph $X$ with $n$ vertices, then $n$ is divisible by four. We also prove that if $X$ is bipartite and regular, then $n$ is the sum of two integer squares. Our work on bipartite graphs implies that uniform mixing does not occur on $C_{2m}$ for $m \geq 3$. Using a result of Haagerup, we show that uniform mixing does not occur on $C_p$ for any prime $p$ such that $p \geq 5$. In contrast to this result, we see that $\epsilon$-uniform mixing occurs on $C_p$ for all primes $p$.

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.

Some Spectral Characterizations of Strongly Distance-Regular Graphs

2001 ◽  
Vol 10 (2) ◽  
pp. 127-135 ◽  
Author(s):  
M. A. FIOL
Keyword(s):  
Regular Graph ◽  
Connected Graph ◽  
Strongly Regular Graphs ◽  
Regular Graphs ◽  
Distance Regular Graph ◽  
Strongly Regular ◽  
Distance Regular Graphs ◽  
Spectral Characterizations

A graph Γ with diameter d is strongly distance-regular if Γ is distance-regular and its distance-d graph Γd is strongly regular. Some known examples of such graphs are the connected strongly regular graphs, with distance-d graph Γd = Γ (the complement of Γ), and the antipodal distance-regular graphs. Here we study some spectral conditions for a (regular or distance-regular) graph to be strongly distance-regular. In particular, for the case d = 3 the following characterization is proved. A regular (connected) graph Γ, with distinct eigenvalues λ0 > λ1 > λ2 > λ3, is strongly distance-regular if and only if λ2 = −1, and Γ3 is k-regular with degree k satisfying an expression which depends only on the order and the different eigenvalues of Γ.

On extensions of small strongly regular graphs with eigenvalue 3

2015 ◽  
Vol 92 (1) ◽  
pp. 482-486
Author(s):  
A. A. Makhnev ◽  
D. V. Paduchikh
Keyword(s):  
Strongly Regular Graphs ◽  
Regular Graphs ◽  
Strongly Regular
Sign in / Sign up

Export Citation Format

Share Document