Note on graphs without repeated cycle lengths

@article{Chen1998NoteOG,
  title={Note on graphs without repeated cycle lengths},
  author={Guantao Chen and Jen{\"o} Lehel and Michael S. Jacobson and Warren E. Shreve},
  journal={Journal of Graph Theory},
  year={1998},
  volume={29},
  pages={11-15}
}
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: 11–?? , 1998 

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-7 OF 7 CITATIONS

Some unsolved problems on cycles

VIEW 5 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Some open problems on cycles ∗

Chunhui Lai, Mingjing Liu
  • 2013
VIEW 5 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

On the number of edges in some graphs

VIEW 1 EXCERPT
CITES BACKGROUND

On the size of graphs without repeated cycle lengths

  • Discrete Applied Mathematics
  • 2016
VIEW 1 EXCERPT
CITES RESULTS

(2)-pancyclic Graphs

  • Discrete Applied Mathematics
  • 2013
VIEW 1 EXCERPT
CITES BACKGROUND

Covering Non-uniform Hypergraphs

  • J. Comb. Theory, Ser. B
  • 2001
VIEW 2 EXCERPTS
CITES BACKGROUND

References

Publications referenced by this paper.
SHOWING 1-7 OF 7 REFERENCES

Upper bound and lower bound of f(n)

Chunhui Lai
  • J. Zhangzhou Teachers College (Natural Science Edition)
  • 1990
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

On maximum cycle-distributed graphs

  • Discrete Mathematics
  • 1988
VIEW 1 EXCERPT

Math

G. A. Dirac, J. Reine Angew
  • 228
  • 1967
VIEW 1 EXCERPT

An affine analogue of Singer’s theorem

R. C. Bose
  • J. Indian Math. Soc. 6
  • 1942
VIEW 1 EXCERPT