Sporadic examples of directed strongly regular graphs obtained by computer algebra experimentation
DOI10.1007/978-3-319-10515-4_12zbMATH Open1416.68219arXiv1408.2127OpenAlexW1223566202MaRDI QIDQ2879322FDOQ2879322
Authors: Štefan Gyürki, Mikhail H. Klin
Publication date: 8 September 2014
Published in: Computer Algebra in Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1408.2127
Recommendations
- Two kinds of constructions of directed strongly regular graphs
- Semidirect product constructions of directed strongly regular graphs
- Directed strongly regular graphs obtained from coherent algebras
- Directed strongly regular graphs with \(\mu=\lambda\)
- A note on a family of directed strongly regular graphs
Directed graphs (digraphs), tournaments (05C20) Symbolic computation and algebraic computation (68W30) Association schemes, strongly regular graphs (05E30) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)
Cited In (8)
- Computing distance-regular graph and association scheme parameters in \texttt{SageMath} with \texttt{sage}-\texttt{drg}
- A Class of Association Schemes and Their Automorphisms
- New tools for the construction of directed strongly regular graphs: difference digraphs and partial sum families
- Infinite families of directed strongly regular graphs using equitable partitions
- Directed strongly regular graphs obtained from coherent algebras
- Semidirect product constructions of directed strongly regular graphs
- A note on directed strongly regular graphs
- Examples of computer experimentation in algebraic combinatorics
Uses Software
This page was built for publication: Sporadic examples of directed strongly regular graphs obtained by computer algebra experimentation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2879322)