相关论文: On the commuting graphs of Brandt semigroups

The dominating graph of a graph G is a graph whose vertices correspond to the dominating sets of G and two vertices are adjacent whenever their corresponding dominating sets differ in exactly one vertex. Studying properties of dominating…

Let $G$ be a finite group. For a fixed element $g$ in $G$ and a given subgroup $H$ of $G$, the relative $g$-noncommuting graph of $G$ is a simple undirected graph whose vertex set is $G$ and two vertices $x$ and $y$ are adjacent if $x \in…

Amit and Linial showed that a random lift of a graph with minimum degree $\delta\ge3$ is asymptotically almost surely $\delta$-connected, and mentioned the problem of estimating this probability as a function of the degree of the lift. We…

Suppose $(X,\sigma)$ is a subshift, $P_X(n)$ is the word complexity function of $X$, and ${\rm Aut}(X)$ is the group of automorphisms of $X$. We show that if $P_X(n)=o(n^2/\log^2 n)$, then ${\rm Aut}(X)$ is amenable (as a countable,…

It is known that the canonical double cover of any connected nonbipartite graph have an automorphism group of the form $H \rtimes \mathbb{Z}_2$, where $H$ is the set of automorphism which preserve bipartite parts. We construct connected…

Circulant graphs are a widely studied family of graphs whose members possess varying amounts of symmetry. Although considerable progress has been made in finding the automorphism groups of circulant graphs under certain restrictions, a…

This paper deals with the Cayley graph $\Cay,$ where the generating set consists of all block transpositions. A motivation for the study of these particular Cayley graphs comes from current research in Bioinformatics. We prove that…

A partial automorphism of a semigroup $S$ is any isomorphism between its subsemigroups, and the set all partial automorphisms of $S$ with respect to composition is the inverse monoid called the partial automorphism monoid of $S$. Two…

The main goal of this note is to suggest an algebraic approach to the quasi-isometric classification of partially commutative groups (alias right-angled Artin groups). More precisely, we conjecture that if the partially commutative groups…

Let $G$ be a finite group. Recall that an $A$-group is a group whose Sylow subgroups are all abelian. In this paper, we investigate the upper bound on the diameter of the commuting graph of a solvable $A$-group. Assuming that the commuting…

A quasi-semiregular element in a permutation group is an element that has a unique fixed point and acts semiregularly on the remaining points. Such elements were first studied in the context of automorphisms of graphs and occur naturally in…

In this paper we introduce the symmetric normaliser graph of a group $G$. The vertex set of this graph consists of elements of the group. Vertices $x$ and $y$ are adjacent if $x$ lies in the normaliser of $\langle y \rangle$ and $y$ lies in…

We extend the notion of the compressed zero-divisor graph $\varTheta(R)$ to noncommutative rings in a way that still induces a product preserving functor $\varTheta$ from the category of finite unital rings to the category of directed…

Let $n$ and $k$ be integers with $n>2k, k\geq1$. We denote by $H(n, k)$ the $bipartite\ Kneser\ graph$, that is, a graph with the family of $k$-subsets and ($n-k$)-subsets of $[n] = \{1, 2, ... , n\}$ as vertices, in which any two vertices…

By an automorphism of a topological group G we mean an isomorphism of G onto itself which is also a homeomorphism. In this article, we study the automorphism group Aut(G) of a dense subgroup G of R^n, n>=1. We show that Aut(G) can be…

The partial automorphisms of a graph $X$ having $N$ vertices are the bijections $\sigma:I\to J$ with $I,J\subset\{1,\ldots,N\}$ which leave invariant the edges. These bijections form a semigroup $\widetilde{G}(X)$, which contains the…

In this work, we define an orthogonal graph on the set of equivalence classes of $(2\nu + \delta)-$tuples over $\mathbb{Z}_{2^n}$ where $n$ and $\nu$ are positive integers and $\delta = 0, 1$ or $2$. We classify our graph if it is strongly…

The set of all centralizers of elements in a finite group $G$ is denoted by $Cent(G)$ and $G$ is called $n-$centralizer if $|Cent(G)| = n$. In this paper, the structure of centralizers in a non-abelian finite group $G$ with this property…

Let $\Gamma(G)$ be the prime graph associated with a finite group $G$ and $D(G)$ be the degree pattern of $G$. A finite group $G$ is said to be $k$-fold OD-characterizable if there exist exactly $k$ non-isomorphic groups $H$ such that…

We study the commuting graph on elements of odd prime order in finite simple groups. The results are used in a forthcoming paper describing the structure of Bruck loops and Bol loops of exponent 2.