Directed strongly regular graphs obtained from coherent algebras

Abstract

The notion of a directed strongly regular graph was introduced by A. Duval in 1988 as one of the possible generalizations of classical strongly regular graphs to the directed case. We investigate this generalization with the aid of coherent algebras in the sense of D.G. Higman. We show that the coherent algebra of a mixed directed strongly regular graph is a non-commutative algebra of rank at least 6. With this in mind, we examine the group algebras of dihedral groups, the flag algebras of a Steiner 2-designs, in search of directed strongly regular graphs. As a result, a few new infinite series of directed strongly regular graphs are constructed. In particular, this provides a positive answer to a question of Duval on the existence of a graph with certain parameter set having 20 vertices. One more open case ୋ This paper is a revised and shortened version of the preprint [29]. This preprint stimulated a new wave of interest in the investigations of d.s.r.g.'s, in particular results by L. Jorgensen, S. A. Hobart and T.J. Shaw, A. Duval and D. Iourinski. We refer to [11,21,25,30] where a part of recent investigations is discussed with more details. We also mention that the most of the current status of the theory of d.s.r.g.'s can be found in Andries Brouwer's home page

Constructions of 1 1/2-designs from symplectic geometry over finite fields

“…Then Γ 1 is a DSRG with parameters (45, 8, 4, 3, 1) when ν = 2, Γ 2 is a DSRG with parameters (24, 12, 8,4,8) and Γ 2 is a DSRG with parameters (24, 11, 7, 6, 4) when ν = m + 1. Let q = 3.…”

Weighted association schemes, fusions, and minimal coherent closures

“…A good introduction to the topic may be found in [16]. We consider an algebra A of n by n matrices, over C with the following properties: This defines the coherent algebra A of degree n and rank r , along with its standard basis.…”

“…Applying the fusion A 0 , A 3 + A 4 , A 1 + A 2 to this scheme gives the Clebsch graph, or SRG (16,5,0,2). This graph may be described in the following way: the vertices are the 16 even-cardinality subsets of {1, 2, .…”

“…The eigenvalues of Γ 1 and Γ 2 are ±x 1 , ±x 2 , where x 1 and x 2 are the roots of (15). Since z i ∈ Z, we see by (16) that either x 1 and x 2 are rational, in which case they are integers as are the remaining eigenvalues (shown in the character-multiplicity table), or 2s 2 11 − t…”

Strongly regular graphs

“…Interest in these graphs was recently revived by Klin, Munemasa, Muzychuk, and Zieschang [9], and there have been a number of recent papers ( [3], [4], [6], [7], [8]). …”