Graphs with equal girth and circumference
From MaRDI portal
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.
This page was built for publication: Graphs with equal girth and circumference
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6413335)
