Transitive regular $q$-analogs of graphs
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914831628500992 |
|---|---|
| author | Crnkovic, Dean Crnkovic, Vedrana Mikulic Svob, Andrea Zutolija, Matea Zubovic |
| author_facet | Crnkovic, Dean Crnkovic, Vedrana Mikulic Svob, Andrea Zutolija, Matea Zubovic |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_07118 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Transitive regular $q$-analogs of graphs Crnkovic, Dean Crnkovic, Vedrana Mikulic Svob, Andrea Zutolija, Matea Zubovic Combinatorics 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. |
| title | Transitive regular $q$-analogs of graphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2406.07118 |