On Mean Distance and Girth

Computer Science – Discrete Mathematics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

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

     

Profile ID: LFWR-SCP-O-400738

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.