MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

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

We have a regular graph $G$ of degree $m$ on $n$ vertices and we label each of its vertices with the number $1$ through $n$. What can we say about the maximum difference between the numbers of two adjacent vertices. What is the maximum and minimum, what is the minimum for a specific graph?

share|cite|improve this question
If I understand your question correctly, I believe the quantity you are asking about is known as graph bandwidth. Perhaps the references on that wiki page will be helpful? – mhum May 19 '14 at 23:18
Yup, that's exactly what I want, In fact I thought of this because of this question:… – Carry on Smiling May 20 '14 at 0:59

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.