Minimum degree polynomial of graphs obtained by some graph operators

The minimum degree matrix M D ( G ) of a graph G of order n is an n × n symmetric matrix whose ( i , j ) t h entry is m i n { d i , d j } whenever i ≠ j , and zero otherwise, where d i and d j are the degrees of the i t h and j t h vertices of G , respectively. In the present work, we obtain the minimum degree polynomial of the graphs obtained by some graph operators (generalized x y z -point-line transformation graphs).