Let vi and vj be two vertices of a graph G. The maximum degree matrix of G is given in [2] by dij = {max {di, dj} if vi and vj are adjacent 0 otherwise. Similarly the (i, j)-th entry of the minimum degree matrix is defined ...