SearcharxivSearch

arXiv · 2508.03632

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)^\times$ be its set of non-zero divisors with respect to the natural partial order $\le $ on $S$, that is, $a \in Z(S)^\times $ if there exists $b\in S\setminus\{0\}$ with $\omega(a, b) = \{c \in S: c \leq a\ \mbox{and}\ c \leq b\}=\{0\}$. The set $Z(S)^\times$ makes up the vertices of the corresponding {\it zero-divisor graph} $\Gamma (S)$, with two distinct vertices $a, b$ forming an edge if $\omega(a, b)=\{0\}$. We characterize {\it 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 $\sigma$ 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$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yanhui Wang, Xinyi Zhu, Pei Gao. 2025-08-05. On the diameter and girth of zero-divisor graphs of inverse semigroups. https://arxiv.org/abs/2508.03632

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR