References & Citations
Mathematics > Combinatorics
Title: Exact distance Kneser graphs
(Submitted on 22 Mar 2024 (v1), last revised 27 Mar 2024 (this version, v2))
Abstract: 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.
Submission history
From: Agustina Victoria Ledezma [view email][v1] Fri, 22 Mar 2024 19:09:20 GMT (15kb)
[v2] Wed, 27 Mar 2024 01:31:58 GMT (15kb)
Link back to: arXiv, form interface, contact.