Classification of commutative zero-divisor semigroup graphs

DOI10.1216/RMJ-2010-40-5-1481MaRDI QIDQ613528zbMATH OpenFDO

Authors Lisa DeMeyer, Yunjiang Jiang, Cleland Loszewski, Erica Purdy

Publication date 21 December 2010

Published in Rocky Mountain Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1216/RMJ-2010-40-5-1481

zbMATH Keywords

semigroup graphtriangulation

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Ordered semigroups and monoids (06F05)

Review text

Let \(S\) denote a commutative semigroup with \(0.\) The associated zero-divisor graph \(\Gamma(S)\) is the graph whose vertices form a one-to-one correspondence with the non-zero elements of \(S\) and two vertices are joined by an edge if the product of the corresponding elements in \(S\) is zero. Given a graph \(G\), does there exist a zero-divisor semigroup \(S\) such that \(G = \Gamma(S)\)? In this case \(G\) is called admissible. The results of the paper are the following: {\parindent=7mm \begin{itemize}\item[(1)]Given a graph \(G\) with connected components \(G_{\alpha}.\) Then \(G\) is admissible if and only if each \(G_{\alpha}\) is, provided that none of the \(G_{\alpha}\) is a singleton. \item[(2)]Every graph (not necessarily connected) is the induced subgraph of a connected admissible graph. \item[(3)]The authors introduce the notion of depth as a new invariant. They reformulate the four admissibility conditions of \textit{F. DeMeyer} and \textit{L. DeMeyer} [J. Algebra 283, No. 1, 190--198 (2005; Zbl 1077.20069)], in terms of the depth and give several other admissibilty conditions in terms of the depth. \item[(4)]They define the notion of graph separability. It is used for a coloring criterion to determine a graph to be non-admissible. \item[(5)]They settle in the affirmative the question: Can be any regular surface (or 2-manifold) be triangulated in such a way that it is the graph of some commutative zero-divisor semigroup? \end{itemize}}

Recommendations

• The zero-divisor graph associated to a semigroup.
• The zero-divisor graph of a commutative semigroup: a survey
• Zero divisor graphs of semigroups.
• Zero-Divisor Semigroups and Some Simple Graphs
• Commutative Zero-divisor Semigroups of Graphs with at Most Four Vertices
• Zero-divisor graphs for semigroups of order 7.
• Semigroups and the zero divisor graph
• The structure of zero-divisor semigroups with graph \(K_n\circ K_2\).
• Commutative rings and zero-divisor semigroups of regular polyhedrons
• Simple Graphs and Zero-divisor Semigroups

Cites work

• Generating the triangulations of the projective plane
• Graphs on surfaces
• scientific article; zbMATH DE number 49719 (Why is no real title available?)
• scientific article; zbMATH DE number 3511136 (Why is no real title available?)
• scientific article; zbMATH DE number 1118889 (Why is no real title available?)
• The zero-divisor graph of a commutative semigroup
• Zero divisor graphs of semigroups.

Cited in

(5)

• The zero-divisor graph of a commutative semigroup
• Annihilators in zero-divisor graphs of semilattices and reduced commutative semigroups
• THE ZERO-DIVISOR GRAPHS OF RINGS AND SEMIRINGS
• The zero-divisor graph of a commutative semigroup: a survey
• Categorial properties of compressed zero-divisor graphs of finite commutative rings

This page was built for publication: Classification of commutative zero-divisor semigroup graphs

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