加载中…
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.

生成讲解博客的中文版本

生成AI智能校验的中文版本