That is the bandwidth is the minimum over all listings of

Question

Let G be a simple graph with n vertices. The bandwidth of G, denoted by B(G), is the minimum, over all permutations a₁, a₂,...,a_n of the vertices of G, of max{|i - j | ai and aj are adjacent}. That is, the bandwidth is the minimum over all listings of the vertices of the maximum difference in the indices assigned to adjacent vertices. Find the bandwidths of these graphs