On the diameter and girth of zero-divisor graphs of inverse semigroups
Abstract
Let S be an inverse semigroup with zero and let Z(S)× be its set of non-zero divisors with respect to the natural partial order on S, that is, a ∈ Z(S)× if there exists b∈ S\0\ with ω(a, b) = \c ∈ S: c ≤ a\ and\ c ≤ b\=\0\. The set Z(S)× makes up the vertices of the corresponding zero-divisor graph (S), with two distinct vertices a, b forming an edge if ω(a, b)=\0\. We characterize zero-divisor graphs of inverse semigroups in terms of their diameter and girth. We also classify inverse semigroups without zero by building a connection between the diameter (girth) and the least group congruence σ on an inverse semigroup without zero. Finally, we give a description of the diameter and girth of graph inverse semigoups I(G) in terms of the set of vertices and the set of edges of a graph G.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.