Construction of Directed Strongly Regular Graphs Using Block Matrices
Combinatorics
2013-11-05 v1
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.
Keywords
Cite
@article{arxiv.1311.0494,
title = {Construction of Directed Strongly Regular Graphs Using Block Matrices},
author = {Francis Adams and Alexandra Gendreau and Oktay Olmez and Sung Yell Song},
journal= {arXiv preprint arXiv:1311.0494},
year = {2013}
}
Comments
19 pages, 3 figures