vix.ing · top · new · best · stats · spec

Construction of Directed Strongly Regular Graphs Using Block Matrices

2013/11/03 by Francis Adams, Alexandra Gendreau, Adams, Francis +7
Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research #Graph theory and applications #Rings, Modules, and Algebras #math.CO

paper · pdf · doi:10.48550/arxiv.1311.0494

19 pages, 3 figures

arxiv created 2013/11/03 · openalex publication_date 2013/11/03 · arxiv updated 2013/11/05 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Related