2014
DOI: 10.1007/978-3-319-10515-4_12
|View full text |Cite
|
Sign up to set email alerts
|

Sporadic Examples of Directed Strongly Regular Graphs Obtained By Computer Algebra Experimentation

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 non-commutative 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.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
13
0

Year Published

2015
2015
2019
2019

Publication Types

Select...
2
1

Relationship

2
1

Authors

Journals

citations
Cited by 3 publications
(13 citation statements)
references
References 18 publications
0
13
0
Order By: Relevance
“…This orbit-partition is good for the unique solution is proved for all positive integer j. For j = 1 the resulting parameter set (78, 36,23,16,17) is new according to [4]. (3,9).…”
Section: Jørgensen's Sporadic Examplesmentioning
confidence: 88%
See 2 more Smart Citations
“…This orbit-partition is good for the unique solution is proved for all positive integer j. For j = 1 the resulting parameter set (78, 36,23,16,17) is new according to [4]. (3,9).…”
Section: Jørgensen's Sporadic Examplesmentioning
confidence: 88%
“…Hence the existence of a DSRG with parameters (54j + 18, 18j + 4, 6j + 3, 6j, 6j + 1) is proven. For j = 1 a DSRG with parameter set (72, 22,9,6,7) has been recently found in [17]. 6.8 DSRG(18,7,5,2,3) For a DSRG (18,7,5,2,3) with adjacency matrix A 18,7 we have to consider two possibilities: (a, b) = (2,9) and (a, b) = (3,6).…”
Section: Srg(16502) -Clebsch Graphmentioning
confidence: 99%
See 1 more Smart Citation
“…Thus X satisfies the conditions (i) and (ii) of the Theorem 1. So we have the Cayley graph C(T 24 , a X ∪ a X b ∪ a X b 2 ∪ a X b 3 ) is a DSRCG with parameters (24, 8,4,0,4), where X = {1, 4}. Theorem 2.…”
Section: Thus We Havementioning
confidence: 99%
“…Observe that the DSRGs have several parameters, there has been many constructions oriented to obtain several infinite families of DSRGs, also, some sporadic examples are known in the literature. Although many scholars have studied the existence and constructions of DSRGs for different parameters (one may refer to [2][3][4][5]), there are also plenty of DSRGs whose existence cannot be determined. As such, the complete characterization of DSRGs is far from being solved.…”
Section: Introductionmentioning
confidence: 99%