pith. sign in

arxiv: 1311.0494 · v1 · pith:2QS7YR6Vnew · submitted 2013-11-03 · 🧮 math.CO

Construction of Directed Strongly Regular Graphs Using Block Matrices

classification 🧮 math.CO
keywords graphsregulardirectedstronglyconstructionmatricesblockcombinatorial
0
0 comments X
read the original abstract

The concept of directed strongly regular graphs was introduced by Duval in his paper, A Directed Graph Version of Strongly Regular Graphs. Duval also provided several construction methods for directed strongly regular graphs. The directed strongly regular graphs reported in this paper are obtained using a block construction of adjacency matrices of regular tournaments and circulant matrices. We then give some algebraic and combinatorial interpretation of these graphs in connection with known directed strongly regular graphs and related combinatorial structures.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.