Exact distance Kneser graphs
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866929290780606464 |
|---|---|
| author | Ledezma, Agustina Victoria Pastine, Adrián Valencia-Pabon, Mario |
| author_facet | Ledezma, Agustina Victoria Pastine, Adrián Valencia-Pabon, Mario |
| contents | For any graph $G = (V,E)$ and positive integer $d$, the exact distance-$d$ graph $G_{=d}$ is the graph with vertex set $V$, where two vertices are adjacent if and only if the distance between them in $G$ is $d$. We study the exact distance-$d$ Kneser graphs. For these graphs, we characterize the adjacency of vertices in terms of the cardinality of the intersection between them. We present formulas describing the distance between any pair of vertices and we compute the diameter of these graphs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_15578 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Exact distance Kneser graphs Ledezma, Agustina Victoria Pastine, Adrián Valencia-Pabon, Mario Combinatorics 05C12 For any graph $G = (V,E)$ and positive integer $d$, the exact distance-$d$ graph $G_{=d}$ is the graph with vertex set $V$, where two vertices are adjacent if and only if the distance between them in $G$ is $d$. We study the exact distance-$d$ Kneser graphs. For these graphs, we characterize the adjacency of vertices in terms of the cardinality of the intersection between them. We present formulas describing the distance between any pair of vertices and we compute the diameter of these graphs. |
| title | Exact distance Kneser graphs |
| topic | Combinatorics 05C12 |
| url | https://arxiv.org/abs/2403.15578 |