Small vertex-transitive directed strongly regular graphs (Q1849885): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
(3 intermediate revisions by 2 users not shown) | |||
Property / author | |||
Property / author: Mikhail E. Muzychuk / rank | |||
Property / reviewed by | |||
Property / reviewed by: Q1349476 / rank | |||
Property / author | |||
Property / author: Mikhail E. Muzychuk / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Aleksandr Alekseevich Makhnev / rank | |||
Normal rank | |||
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 05: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