Graphs with equal girth and circumference
Combinatorics
2022-10-11 v1
Abstract
We characterise the form of all simple, finite graphs for which the girth of the graph is equal to the circumference of the graph. We apply this to prove a bound on the number of edges in such a graph.
Cite
@article{arxiv.2210.04109,
title = {Graphs with equal girth and circumference},
author = {Lewis Stanton and Jeffrey Thompson},
journal= {arXiv preprint arXiv:2210.04109},
year = {2022}
}
Comments
15 pages, comments welcome