# labeling vertices in a graph to minimize distance between adjacent vertices

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?

-
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: artofproblemsolving.com/Forum/… – Carry on Smiling May 20 '14 at 0:59