A Lower Bound for the Circumference Involving Connectivity

Details A Lower Bound for the Circumference Involving Connectivity A Lower Bound for the Circumference Involving Connectivity

2009-07-15

arxiv.org/abs/0907.2490v1

Mathematics

Combinatorics

32 pages

Scientific paper

Let $G$ be a graph, $C$ a longest cycle in $G$ and $\overline{p}$, $\overline{c}$ the lengths of a longest path and a longest cycle in $G\backslash C$, respectively. Almost all lower bounds for the circumference base on a standard procedure: choose an initial cycle $C_0$ in $G$ and try to enlarge it via structures of $G\backslash C_0$ and connections between $C_0$ and $G\backslash C_0$ closely related to $\overline{p}$, $\overline{c}$ and connectivity $\kappa$. Actually, each lower bound obtained in result of this procedure, somehow or is related to $\kappa$, $\overline{p}$, $\overline{c}$ but in forms of various particular values of $\kappa$, $\overline{p}$, $\overline{c}$ and the major problem is to involve these invariants into such bounds as parameters. In this paper we present a lower bound for the circumference involving $\delta$, $\kappa$ and $\overline{c}$ and increasing with $\delta$, $\kappa$ and $\overline{c}$.

Affiliated with

Also associated with

No associations

Rating

A Lower Bound for the Circumference Involving Connectivity 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 A Lower Bound for the Circumference Involving Connectivity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Lower Bound for the Circumference Involving Connectivity will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-364056