Note on graphs without repeated cycle lengths


In this note we prove that every 2-connected graph of order n with no repeated cycle lengths has at most n + √ 2(n− 2) − 1 edges and we show this result is best possible with the correct order of magnitude on √ n. The 2connected case is also used to give a quick proof of Lai’s result on the general case. c © 1998 John Wiley & Sons, Inc. J Graph Theory 29… (More)
DOI: 10.1002/(SICI)1097-0118(199809)29:1%3C11::AID-JGT2%3E3.0.CO;2-H


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics