Nonexistence of certain edge-girth-regular graphs
Combinatorics
2024-04-01 v1
Abstract
Edge-girth-regular graphs (abbreviated as \emph{egr} graphs) are regular graphs in which every edge is contained in the same number of shortest cycles. We prove that there is no -regular \emph{egr} graph with girth such that every edge is on exactly shortest cycles, and there is no -regular \emph{egr} graph with girth such that every edge is on exactly shortest cycles. This was conjectured by Goedgebeur and Jooken. A few other unresolved cases are settled as well.
Keywords
Cite
@article{arxiv.2403.20049,
title = {Nonexistence of certain edge-girth-regular graphs},
author = {Leen Droogendijk},
journal= {arXiv preprint arXiv:2403.20049},
year = {2024}
}
Comments
17 pages, 4 figures