Year: 2022
Type: preprint
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.
Source: arXiv (Cornell University)
Authors: Stanton, Lewis, Thompson, Jeffrey
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W4304701251