Exact distance Kneser graphs
Combinatorics
2024-03-28 v2
Abstract
For any graph and positive integer , the exact distance- graph is the graph with vertex set , where two vertices are adjacent if and only if the distance between them in is . We study the exact distance- 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.
Keywords
Cite
@article{arxiv.2403.15578,
title = {Exact distance Kneser graphs},
author = {Agustina Victoria Ledezma and Adrián Pastine and Mario Valencia-Pabon},
journal= {arXiv preprint arXiv:2403.15578},
year = {2024}
}