Sign up ×
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.

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
This paper might be of interest to you: – Joseph Malkevitch Apr 17 '12 at 15:48

Your Answer


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

Browse other questions tagged or ask your own question.