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

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 …

The problem of deciding whether two graphs are isomorphic is fundamental in graph theory.
Moreover, the flexibility with which other combinatorial objects can be modeled by graphs …

In 1933 Karol Borsuk asked whether each bounded set in the n-dimensional Euclidean
space can be divided into n+ 1 parts of smaller diameter. The diameter of a set is defined as …

Let G be a finite permutation group acting primitively on sets Il and K2. We describe a
construction of a 1-design with the block set Slı and the point set SB2, having G as an …

Let G be a finite group acting primitively on the sets Ω 1 and Ω 2. We describe a construction
of 1-designs with block set Ω 1 and block set Ω 2, having G as an automorphism group …

Sažetak We construct self-orthogonal codes from the row span over F2 or F3 of the
adjacency matrices of some strongly regular graphs defined by the rank-3 action of the …

In this paper, we consider the maximum coclique design of the sporadic Suzuki graph. Then
we obtain the 3-(66, 16, 21) design with the automorphism group U3 (4): 4. We construct this …

We consider simple loopless finite undirected graphs. Such a graph is called strongly
regular with parameter set (v, k, l, m), for short a srg (v, k, l, m), iff it has exactly v vertices …