The Bandwidth Problem seeks for a simultaneous permutation of the rows and columns adjacency matrix graph such that all nonzero entries are as close possible to main diagonal. This work focuses on investigating novel approaches obtain lower bounds bandwidth problem. In particular, we use vertex partitions bound graph. Our approach contains prior bounding special cases. By varying sizes partitio...