Zero divisor graphs of semigroups. (Q1770496)

From MaRDI portal
Revision as of 19:17, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
Zero divisor graphs of semigroups.
scientific article

    Statements

    Zero divisor graphs of semigroups. (English)
    0 references
    0 references
    0 references
    7 April 2005
    0 references
    Let \(S\) be a commutative semigroup with \(0\). A simple graph \(G\) whose vertices are the nonzero zero divisors of \(S\) with two distinct vertices joined by an edge in case when their product in \(S\) is \(0\) is called the zero divisor graph of \(S\). In the paper some characterizations of graphs to be zero divisor graphs of a semigroup are given. An association with \(S\) of a simplicial complex \(K(S)\) with \(S\), where a simplex is a subset \(A\) of \(S-\{0\}\) with the property that \(x,y\in A\) with \(x\neq y\) implies \(xy=0\) is introduced to give some interesting examples of zero divisor graphs, such as a graph \(G\) with the property that every edge in \(G\) is the edge of a triangle and \(G\) is the zero divisor graph of a semilattice but not the zero divisor graph for any nilpotent semigroup.
    0 references
    zero divisor graphs
    0 references
    simplicial complexes
    0 references
    nilpotent semigroups
    0 references

    Identifiers