Transitive regular q-analogs of graphs
Abstract
In 1976, Delsarte introduced the notion of q-analogs of designs, and q-analogs of graphs were introduced recently by M. Braun et al. In this paper, we extend that study by giving a method for constructing transitive regular q-analogs of graphs. Further, we illustrate the method by giving some examples. Additionally, we introduced the notion of q-analogs of quasi-strongly regular graphs and give examples of transitive q-analogs of quasi-strongly regular graphs coming from spreads.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.