Transitive regular $q$-analogs of graphs
Combinatorics
2024-06-12 v1
Abstract
In 1976, Delsarte introduced the notion of -analogs of designs, and -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 -analogs of graphs. Further, we illustrate the method by giving some examples. Additionally, we introduced the notion of -analogs of quasi-strongly regular graphs and give examples of transitive -analogs of quasi-strongly regular graphs coming from spreads.
Cite
@article{arxiv.2406.07118,
title = {Transitive regular $q$-analogs of graphs},
author = {Dean Crnkovic and Vedrana Mikulic Crnkovic and Andrea Svob and Matea Zubovic Zutolija},
journal= {arXiv preprint arXiv:2406.07118},
year = {2024}
}
Comments
9 pages