Simple Graphs and Zero-divisor Semigroups

From MaRDI portal



Abstract: In this paper, we study commutative zero-divisor semigroups determined by graphs. We prove a uniqueness theorem for a class of graphs. We show two classes of graphs that have no corresponding semigroups. In particular, any complete graph Kn together with more than three end vertices and any complete bipartite graph together with more than one end vertices have no corresponding semigroups. We also determine all possible zero-divisor semigroups whose zero-divisor graph is the com- plete graph K3 together with two end vertices.












This page was built for publication: Simple Graphs and Zero-divisor Semigroups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3633819)