Strongly Regular Graphs Page 1 Chapter 9 Strongly Regular Graphs 9.1 Strongly regular
graphs A graph (simple, undirected, and loopless) of order v is called strongly regular with …

Strongly regular graphs lie at the intersection of statistical design, group theory, finite
geometry, information and coding theory, and extremal combinatorics. This monograph …

We study (symmetric) three-class association schemes. The graphs with four distinct
eigenvalues which are one of the relations of such a scheme are characterized. We also …

Recent progress in algebraic design theory Page 1 Finite Fields and Their Applications 11 (2005)
622–653 http://www.elsevier.com/locate/ffa PG1- Recent progress in algebraic design theory …

A divisible design graph is a graph whose adjacency matrix is the incidence matrix of a
divisible design. Divisible design graphs are a natural generalization of (v, k, λ)-graphs, and …

We show that there is no (75, 32, 10, 16) strongly regular graph. The result is obtained by a
mix of algebraic and computational approaches. The main idea is to build large enough …

A divisible design graph is a graph whose adjacency matrix is an incidence matrix of a
(group) divisible design. Divisible design graphs were introduced in 2011 as a …

Extracting structured subgraphs inside large graphs---often known as the planted subgraph
problem---is a fundamental question that arises in a range of application domains. This …

Let Γ be an edge-regular graph with given parameters (v, k, λ). We show how to apply a
certain “block intersection polynomial” in two variables to determine a good upper bound on …

We consider a rank 112 coherent configuration S= AP (2) on 28 points with 7 fibers of size 4.
We describe S both axiomatically and as a model arising via the regular action of E8 on the …