Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I'm looking for bounds on diameter of a given undirected graph with $n$ vertices and $m$ edges? Formally, I look to find $D_{min}$ and $D_{max}$ such that: $D_{min}\leq Diamter\leq D_{max}$ and it is possible to construct a graph (with $n$ vertices and $m$ edges) satisfying the equalities. A trivial bound is $1\leq Diameter\leq n-1$. Thank you.

share|cite|improve this question
1  
This paper might be of interest to you: math.ucsd.edu/~fan/mypaps/fanpap/107diameters.pdf – Joseph Malkevitch Apr 17 '12 at 15:48

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.