Small vertex-transitive directed strongly regular graphs (Q1849885): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: nauty / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Latest revision as of 04:56, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Small vertex-transitive directed strongly regular graphs |
scientific article |
Statements
Small vertex-transitive directed strongly regular graphs (English)
0 references
2 December 2002
0 references
A simple directed graph \(\Gamma\) is called directed strongly regular graph with parameters \((n,k,\mu,\lambda,t)\) if its adjacency matrix \(A=A(\Gamma)\) satisfies \(AJ=JA=kJ\) and \(A^2=tI+\lambda A+\mu(J-I-A)\). In this paper all such graphs with \(n\) vertices, \(n\leq 20\), having vertex-transitive automorphism group are determined with the aid of a computer. This, together with a recent result by Jorgensen gives a complete answer to Duval's question about the existence of directed strongly regular graphs with \(n\leq 20\).
0 references
directed strongly regular graph
0 references
Cayley graphs
0 references
