Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2010.05000

On the commuting graphs of Brandt semigroups

Jitender Kumar·Sandeep Dalal·Pranav Pandey
View original source ↗Read source document ↗Export metadata ↓

Abstract

The commuting graph of a finite non-commutative semigroup S, denoted by \Delta(S), is the simple graph whose vertices are the non-central elements of S and two distinct vertices x; y are adjacent if xy = yx. In the present paper, we study various graph-theoretic properties of the commuting graph \Delta(B_n) of Brandt semigroup B_n including its diameter, clique number, chromatic number, independence number, strong metric dimension and dominance number. Moreover, we obtain the automorphism group Aut(\Delta(Bn)) and the endomorphism monoid End(\Delta(Bn)) of \Delta(Bn). We show that Aut(\Delta(Bn)) = S_n \times Z_2, where S_n is the symmetric group of degree n and Z_2 is the additive group of integers modulo 2. Further, for n \geq 4, we prove that End(\Delta(Bn)) =Aut(\Delta(Bn)). In order to provide an answer to the question posed in [2], we ascertained a class of inverse semigroups whose commuting graph is Hamiltonian.

Explore related subjects

math.GR

Keep this discovery

BibTeXRIS

Jitender Kumar, Sandeep Dalal, Pranav Pandey. 2020-10-10. On the commuting graphs of Brandt semigroups. https://arxiv.org/abs/2010.05000

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗