NOTE ON GRAPHS WITHOUT REPEATED CYCLE LENGTHS

Authors
CHEN GT LEHEL J JACOBSON MS SHREVE WE
Citation
Gt. Chen et al., NOTE ON GRAPHS WITHOUT REPEATED CYCLE LENGTHS, Journal of graph theory, 29(1), 1998, pp. 11-15
Citations number
7
Categorie Soggetti
Mathematics,Mathematics
Journal title
Journal of graph theory → ACNP
ISSN journal
03649024
Volume
29
Issue
1
Year of publication
1998
Pages
11 - 15
Database
ISI
SICI code
0364-9024(1998)29:1<11:NOGWRC>2.0.ZU;2-W
Abstract
In this note we prove that every 2-connected graph of order n with no repeated cycle lengths has at most n + root 2(n - 2) - 1 edges and we show this result is best possible with the correct order of magnitude on root n. The 2-connected case is also used to give a quick proof of Lai's result on the general case. (C) 1998 John Wiley & Sons, Inc.