Abstract
The study of cyclic graphs has always been a hot topic in the field of graph theory and has received widespread attention from graph theory practitioners. If an n-order graph G exactly contains cycles of all lengths from 3 to n, then the graph is called a pan cycle graph. This article proves that, after excluding some special cases, when the number of edges in graph G is greater than or equal to C2n-3+12, graph G must be a pan cyclic graph.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
