In this paper we first present a combinatorial characterization of an inverse monoid of a graph. Then using this we prove that a bipartite graph with an inverse monoid is uniquely K_2, and that a graph G has an invers...In this paper we first present a combinatorial characterization of an inverse monoid of a graph. Then using this we prove that a bipartite graph with an inverse monoid is uniquely K_2, and that a graph G has an inverse monoid if and only if the join of G and a complete graph also has an inverse monoid.展开更多
文摘In this paper we first present a combinatorial characterization of an inverse monoid of a graph. Then using this we prove that a bipartite graph with an inverse monoid is uniquely K_2, and that a graph G has an inverse monoid if and only if the join of G and a complete graph also has an inverse monoid.
