The theory of rough sets has been classified into several directions where the information granules are generated using tolerances, pre-orders and binary relations. Maximal Compatibility Block (MCB) plays an important role in case of tolerance relations. In the present work, the lattice structure of rough sets generated by MCBs is explored. The concepts are applied to establish equivalence between the isomorphism of graphs with isomorphism of rough lattices constructed using MCBs.