The cycle spectrum of claw-free Hamiltonian graphs (Q5964977): Difference between revisions

For a graph \(G\), the set of cycle lengths of \(G\) is the cycle spectrum \(S(G)\) and \(s(G)=|S(G)|\) is the number of different cycle lengths of \(G\). The authors prove the following result: Theorem 1. If \(G\) is a claw-free Hamiltonian graph of order \(n\) and maximum degree \(\Delta\) with \(\Delta\geq24\), then \(s(G)\geq\min\{n,\left\lceil {\frac32\Delta}\right\rceil\}-2\).