Note on graphs without repeated cycle lengths
Guantao Chen, Jenő Lehel, Michael S. Jacobson, Warren E. Shreve · Journal of Graph Theory · 1998
In this note we prove that every 2-connected graph of order n with no repeated cycle lengths has at most edges and we show this result is best possible with the correct order of magnitude on $\sqrt{n}$. The 2-connected case is also used to give a quick proof of Lai's result on the general case. © 1998 John Wiley & Sons, Inc. J. Graph Theory 29: 11–15, 1998