Simple Graphs and Commutative Zero-Divisor Semigroups

Simple item page
dc.creatorWu, Tongsuo
dc.creatorChen, Li
dc.date2005-12-26
dc.date.accessioned2026-07-07T06:55:45Z
dc.date.available2026-07-07T06:55:45Z
dc.descriptionIn 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 $K_n$ 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 $K_3$ together with two end vertices.
dc.description12 Pages
dc.identifierhttps://arxiv.org/abs/math/0512567
dc.identifierhttp://arxiv.org/abs/math/0512567
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/106385
dc.subjectRings and Algebras
dc.subject20M14, 05C90
dc.titleSimple Graphs and Commutative Zero-Divisor Semigroups
dc.typetext

Files

Collections

arXiv