Small vertex-transitive directed strongly regular graphs
type: Item
instance of: scholarly article
title: Small vertex-transitive directed strongly regular graphs
zbMATH Open document ID: 1009.05139
DOI: 10.1016/S0012-365X(01)00391-0
author: Frank Fiedler
author: Mikhail H. Klin
author: Mikhail Muzychuk
published in: Discrete Mathematics
publication date: 2002-12-02T00:00:00Z
review text: 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\).
Mathematics Subject Classification ID: 05E30
zbMATH DE Number: 1838884
zbMATH Keywords: directed strongly regular graph
zbMATH Keywords: Cayley graphs
reviewed by: Alexandre A. Makhnev
describes a project that uses: nauty
MaRDI profile type: Publication
Recommended article: Small Directed Strongly Regular Graphs
Recommended article: A directed graph version of strongly regular graphs
Recommended article: Small vertex-transitive graphs of given degree and girth
Recommended article: Strongly regular edge-transitive graphs
Recommended article: Directed Strongly Regular Graphs and Their Constructions
Recommended article: A note on directed strongly regular graphs
Recommended article: On small symmetric strongly regular graphs
Recommended article: Q5234639
Recommended article: Connectivity of Regular Directed Graphs with Small Diameters
Recommended article: Directed strongly walk-regular graphs
description: scientific article; zbMATH DE number 1838884