On Mean Distance and Girth

Details On Mean Distance and Girth On Mean Distance and Girth

2008-06-09

arxiv.org/abs/0806.1438v1

Computer Science

Discrete Mathematics

Scientific paper

We bound the mean distance in a connected graph which is not a tree in function of its order $n$ and its girth $g$. On one hand, we show that mean distance is at most $\frac{n+1}{3}-\frac{g(g^2-4)}{12n(n-1)}$ if $g$ is even and at most $\frac{n+1}{3}-\frac{g(g^2-1)}{12n(n-1)}$ if $g$ is odd. On the other hand, we prove that mean distance is at least $\frac{ng}{4(n-1)}$ unless $G$ is an odd cycle.

Affiliated with

Also associated with

No associations

Rating

On Mean Distance and Girth 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 Mean Distance and Girth, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Mean Distance and Girth will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-400738