We study combinatorial configurations with the associated point and line graphs being strongly regular. Examples not belonging to known classes such as partial geometries their generalizations or elliptic semiplanes are constructed. Necessary existence conditions proved a table of feasible parameters at most 200 points is presented. Non-existence some proved.

We construct twelve infinite families of pseudocyclic and non-amorphic association schemes, in which each nontrivial relation is a strongly regular graph. Three of the twelve families generalize the counterexamples to A. V. Ivanov’s conjecture by Ikuta and Munemasa [13].

A block negacyclic Bush-type Hadamard matrix of order 36 is used in a symmetric BGW(26, 25, 24) with zero diagonal over a cyclic group of order 12 to construct a twin strongly regular graph with parameters v=936, k=375, l=m=150 whose points can be partitioned in 26 cocliques of size 36. The same Hadamard matrix then is used in a symmetric BGW(50, 49, 48) with zero diagonal over a cyclic group o...

We construct two-intersection sets in PG(5, q), q odd, admitting PSL(2, q), whose associated strongly regular graphs have the same parameters as, but are not isomorphic to, Paley graphs.

A graph Γ with diameter d is strongly distance-regular if Γ is distanceregular and its distance-d graph Γd is strongly regular. The known examples are all the connected strongly regular graphs (i.e. d = 2), all the antipodal distanceregular 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...

In this paper we unify several existing regularity conditions for graphs, including strong regularity, k-isoregularity, and the t-vertex condition. We develop an algebraic composition/decomposition theory of conditions. Using our theoretical results show that a family non rank 3 graphs known to satisfy 7-vertex condition fulfills even stronger condition, (3,7)-regularity (the notion is defined ...

In this paper we introduce the smallest equivalence relation ξ∗ on a finite fuzzy hypergroup S such that the quotient group S/ξ∗, the set of all equivalence classes, is a solvable group. The characterization of solvable groups via strongly regular relation is investigated and several results on the topic are presented.

New (96,20,4,4) and (96,19,2,4) regular partial difference sets are constructed, together with the corresponding strongly regular graphs. Our source are (96,20,4) regular symmetric designs.

We examine the problem of finite-state representability of infinitestate processes w.r.t. certain behavioural equivalences. We show that the classical notion of regularity becomes insufficient in case of all equivalences of van Glabbeek’s hierarchy except bisimilarity, and we design and justify a generalization in the form of strong regularity and finite characterizations. We show that the cond...