The bandwidth of an arbitrary graph G is one less than the size of the maximum clique in an indifference graph that contains G as a subgraph and is chosen to minimize the size of the maximum clique [REF].
Indifference graphs obey the reconstruction conjecture: they are uniquely determined by their vertex-deleted subgraphs [REF].