On Longest Cycle $C$ of a graph $G$ via Structures of $G-C$

Details On Longest Cycle $C$ of a graph $G$ via Structures of $G-C$ On Longest Cycle $C$ of a graph $G$ via Structures of $G-C$

2009-05-09

arxiv.org/abs/0905.1394v1

Mathematics

Combinatorics

9 pages

Scientific paper

Two sharp lower bounds for the length of a longest cycle $C$ of a graph $G$ are presented in terms of the lengths of a longest path and a longest cycle of $G-C$, denoted by $\overline{p}$ and $\overline{c}$, respectively, combined with minimum degree $\delta$: (1) $|C|\geq(\overline{p}+2)(\delta-\overline{p})$ and (2) $|C|\geq(\overline{c}+1)(\delta-\overline{c}+1)$.

Affiliated with

Also associated with

No associations

Rating

On Longest Cycle $C$ of a graph $G$ via Structures of $G-C$ does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On Longest Cycle $C$ of a graph $G$ via Structures of $G-C$, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Longest Cycle $C$ of a graph $G$ via Structures of $G-C$ will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-688936