On bipartite distance-regular Cayley graphs with diameter $3$
Combinatorics
2021-09-29 v3
Abstract
In this paper, we show that every bipartite distance-regular Cayley graph with diameter can be constructed on the semidirect product of a group and , except possibly for one case.
Keywords
Cite
@article{arxiv.1904.06696,
title = {On bipartite distance-regular Cayley graphs with diameter $3$},
author = {Mojtaba Jazaeri},
journal= {arXiv preprint arXiv:1904.06696},
year = {2021}
}
Comments
This one is a small part of the paper entitled as "On bipartite distance-regular Cayley graphs with small diameter" in arXiv