Let G be a simple graph with n vertices. The bandwidth of
Chapter , Problem 51E(choose chapter or problem)
Problem 51E
Let G be a simple graph with n vertices. The bandwidth of G, denoted by B(G), is the minimum, overall permutations a1, a2,... ,an 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.
a) K5
b) K 1,3
c) K2,3
d) K3,3
e) Q3
f) C5
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer