Sporadic examples of directed strongly regular graphs obtained by computer algebra experimentation

Štefan Gyürki, Mikhail Klin

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Scopus citations

Abstract

We report about the results of the application of modern computer algebra tools for construction of directed strongly regular graphs. The suggested techniques are based on the investigation of noncommutative association schemes and Cayley graphs over non-Abelian groups. We demonstrate examples of directed strongly regular graphs for 28 different parameter sets, for which the existence of a corresponding digraph has not been known before.

Original languageEnglish
Title of host publicationComputer Algebra in Scientific Computing - 16th International Workshop, CASC 2014, Proceedings
PublisherSpringer Verlag
Pages155-170
Number of pages16
ISBN (Print)9783319105147
DOIs
StatePublished - 1 Jan 2014
Event16th International Workshop on Computer Algebra in Scientific Computing, CASC 2014 - Warsaw, Poland
Duration: 8 Sep 201412 Sep 2014

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8660 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference16th International Workshop on Computer Algebra in Scientific Computing, CASC 2014
Country/TerritoryPoland
CityWarsaw
Period8/09/1412/09/14

Fingerprint

Dive into the research topics of 'Sporadic examples of directed strongly regular graphs obtained by computer algebra experimentation'. Together they form a unique fingerprint.

Cite this