A bandwidth reduction algorithm for L-shaped and Z-shaped grid structured graphs

► In this study, we have proposed an effective bandwidth reduction algorithm. ► This algorithm is modeled mainly for structured graphs such as the L-structured and Z-structured graphs of any size. ► A near optimal value is obtained on implementing the algorithm for the above two structured graphs.