Strongly regular graphs Page 1 Strongly regular graphs Peter J. Cameron Queen Mary,
University of London London E1 4NS UK Draft, April 2001 Abstract Strongly regular graphs …

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 …

As a generalization of attenuated spaces, the concept of singular linear spaces was
introduced in [K. Wang, J. Guo, F. Li, Association schemes based on attenuated spaces …

We study the quasi-strongly regular graphs, which are a combinatorial generalization of the
strongly regular and the distance regular graphs. Our main focus is on quasi-strongly regular …

A Deza graph with parameters is a‐regular graph with vertices, in which any two vertices
have or () common neighbours. A Deza graph is strictly Deza if it has diameter, and is not …

A regular clique in a regular graph is a clique such that every vertex outside of the clique is
adjacent to the same positive number of vertices inside the clique. We continue the study of …

Subconstituents of symplectic graphs - ScienceDirect Skip to main contentSkip to article
Elsevier logo Journals & Books Search RegisterSign in View PDF Download full issue Search …

Circle geometries are incidence structures that capture the geometry of circles on spheres,
cones and hyperboloids in three‐dimensional space. In a previous paper, the author …

The WL-rank of a digraph Γ Γ is defined to be the rank of the coherent configuration of Γ Γ.
The WL-dimension of Γ Γ is defined to be the smallest positive integer m for which Γ Γ is …

A non-empty k-regular graph Γ on n vertices is called a Deza graph if there exist constants b
and a (b≥ a) such that any pair of distinct vertices of Γ has either b or a common …