For strongly regular graphs with adjacency matrix A, we look at the binary codes generated by A and A+ I . We determine these codes for some families of graphs, we pay attention to the relation between the codes of switching equivalent graphs and, with the exception of two parameter sets, we generate by computer the codes of all known strongly regular graphs on fewer than 45 vertices.

In this paper we give a lower bound for the least distortion embedding of a distance regular graph into Euclidean space. We use the lower bound for finding the least distortion for Hamming graphs, Johnson graphs, and all strongly regular graphs. Our technique involves semidefinite programming and exploiting the algebra structure of the optimization problem so that the question of finding a lowe...

In this paper we generalize the absolute bound for association schemes to coherent configurations. We examine this bound in the context of quasi-symmetric and strongly regular designs. In particular, we use it to derive a new feasibility condition for strongly regular designs and give examples of parameter sets ruled out by this condition but which pass all other feasibility conditions known to...

We analyze when the Moore–Penrose inverse of the combinatorial Laplacian of a distance– regular graph is a M–matrix; that is, it has non–positive off–diagonal elements. In particular, our results include some previously known results on strongly regular graphs.

An important property of strongly regular graphs is that the second subconstituent of any primitive strongly regular graph is always connected. Brouwer asked to what extent this statement can be generalized to distanceregular graphs. In this paper, we show that if γ is any vertex of a distanceregular graph Γ and t is the index where the standard sequence corresponding to the second largest eige...

Antipodal covers of strongly regular graphs which are not necessarily distance-regular are studied. The structure of short cycles in an antipodal cover is considered. In most cases, this provides a tool to determine if a strongly regular graph has an antipodal cover. In these cases, covers cannot be distance-regular except when they cover a complete bipartite graph. A relationship between antip...

Let be an antipodal distance-regular graph of diameter 4, with eigenvalues θ0 > θ1 > θ2 > θ3 > θ4. Then its Krein parameter q4 11 vanishes precisely when is tight in the sense of Jurišić, Koolen and Terwilliger, and furthermore, precisely when is locally strongly regular with nontrivial eigenvalues p := θ2 and −q := θ3. When this is the case, the intersection parameters of can be parametrized b...

We consider a distance-regular graph ? with diameter d 3 and eigenvalues k = 0 > 1 > > d. We show the intersection numbers a 1 ; b 1 satisfy (a 1 + 1) 2 : We say ? is tight whenever ? is not bipartite, and equality holds above. We characterize the tight property in a number of ways. For example, we show ? is tight if and only if the intersection numbers are given by certain rational expressions...

The inequality of Higman for generalized quadrangles of order (s, t) with s > 1 states that t ≤ s. We will generalize this by proving that the intersection number ci of a regular near 2d-gon of order (s, t) with s > 1 satisfies the tight bound ci ≤ (s − 1)/(s − 1), and we give properties in case of equality. It is known that hemisystems in generalized quadrangles meeting the Higman bound induce...

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...