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 …

An automaton (consisting of a finite set of states with given transitions) is said to be
synchronizing if there is a word in the transitions which sends all states of the automaton to a …

An intriguing set of points of a generalised quadrangle was introduced in [J. Bamberg, M.
Law, T. Penttila, Tight sets and m-ovoids of generalised quadrangles, Combinatorica, in …

Abstract The Hall–Paige conjecture asserts that a finite group has a complete map** if
and only if its Sylow subgroups are not cyclic. The conjecture is now proved, and one aim of …

Near polygons were introduced about 25 years ago and studied intensively in the 1980s. In
recent years the subject has regained interest. This monograph gives an extensive overview …

The goal of this thesis is to apply techniques from algebraic graph theory to finite incidence
geometry. The incidence geometries under consideration include projective spaces, polar …

In this paper we collect results on the possible sizes of k-blocking sets. Since 5 previous
surveys focused mainly on blocking sets in the plane, we concentrate our 6 attention on …

Let Γ be an embeddable non-degenerate polar space of finite rank n≥ 2. Assuming that Γ
admits the universal embedding (which is true for all embeddable polar spaces except grids …

1 Finite classical polar spaces Page 1 i In: Current research topics in Galois geometry Editor:
L. Storme, pp. 33-58 ISBN 0000000000 c 2010 Nova Science Publishers, Inc. Chapter 2 …