Graph bandwidth is a measure of how "spread out" the vertices of a graph are when it is represented in a certain way, particularly in terms of the adjacency matrix of the graph. Specifically, for a given graph \( G \) with vertex set \( V \), if we arrange the vertices in a specific order or permutation, the bandwidth is defined as the maximum distance between any two vertices that are connected by an edge in that arrangement.
New to topics? Read the docs here!