1 problem

Let $G$ be a graph on the vertex set $x,y$ with adjacency matrix … Assume $A\geq D$, $A,B,C,D>0$, and $(A-C)(B-D)<0$, and let $\mathcal{M}(G)$ denote its graph monoid. Graph-monoid…