# 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} }

- Published in Journal of Graph Theory 1998
DOI:10.1002/(SICI)1097-0118(199809)29:1%3C11::AID-JGT2%3E3.0.CO;2-H

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 ∗

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

VIEW 1 EXCERPT

CITES RESULTS

## Graphs with no equal length cycles

VIEW 1 EXCERPT

## (2)-pancyclic Graphs

VIEW 1 EXCERPT

CITES BACKGROUND

## Covering Non-uniform Hypergraphs

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)

VIEW 4 EXCERPTS

HIGHLY INFLUENTIAL

## On maximum cycle-distributed graphs

VIEW 1 EXCERPT

## Graph Theory with Applications

VIEW 1 EXCERPT

## Math

VIEW 1 EXCERPT

## An affine analogue of Singer’s theorem

VIEW 1 EXCERPT

## Congruent Graphs and the Connectivity of Graphs

VIEW 1 EXCERPT