q-Analogs of strongly regular graphs

2021/05/30 by Michael Braun, Dean Crnković, Braun, Michael +7 · 1 citation
Computer Science · Mathematics · #Coding theory and cryptography #Finite Group Theory Research #Rings, Modules, and Algebras

paper · pdf · doi:10.48550/arxiv.2105.14525

Abstract

We introduce the notion of q-analogs of strongly regular graphs and give several examples of such structures. We prove a necessary condition on the parameters, show the connection to designs over finite fields, and present a classification.

Cited by

• The incidence matrix of a q-ary graph

Related

• Transitive regular q-analogs of graphs
• q-Analogs of divisible design graphs and Deza graphs
• Quasi-strongly regular graphs on the flags of symmetric designs
• Distance-regular graphs, the subconstituent algebra, and the Q-polynomial property
• On the Q-polynomial property of the full bipartite graph of a Hamming graph