On the diameter and girth of zero-divisor graphs of inverse semigroups
Group Theory
2025-08-06 v1 Combinatorics
Abstract
Let be an inverse semigroup with zero and let be its set of non-zero divisors with respect to the natural partial order on , that is, if there exists with . The set makes up the vertices of the corresponding {\it zero-divisor graph} , with two distinct vertices forming an edge if . 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 on an inverse semigroup without zero. Finally, we give a description of the diameter and girth of graph inverse semigoups in terms of the set of vertices and the set of edges of a graph .
Cite
@article{arxiv.2508.03632,
title = {On the diameter and girth of zero-divisor graphs of inverse semigroups},
author = {Yanhui Wang and Xinyi Zhu and Pei Gao},
journal= {arXiv preprint arXiv:2508.03632},
year = {2025}
}
Comments
14 pages