Related papers: A matrix ring with commuting graph of maximal diam…
We define a statistic on the graph of commutation classes of a permutation of the symmetric group which is used to show that these graphs are equipped with a ranked poset structure, with a minimum and maximum. This characterization also…
Let $S, K$ be two subrings of a finite ring $R$. Then the generalized non-commuting graph of subrings $S, K$ of $R$, denoted by $\Gamma_{S, K}$, is a simple graph whose vertex set is $(S \cup K) \setminus (C_K(S) \cup C_S(K))$ and two…
The general ideal of this paper is to answer the following question: given a numerical property of commuting graphs, a class of semigroups $\mathcal{C}$ and $n\in\mathbb{N}$, is it possible to find a semigroup in $\mathcal{C}$ such that the…
We determine the metric dimension of the zero-divisor graph of the matrix semiring over a commutative entire antinegative semiring.
For a group $G$ and a subset $X$ of $G$, the commuting graph of $X$, denoted by $\Gamma(G,X)$ is the graph whose vertex set is $X$ and any two vertices $u$ and $v$ in $X$ are adjacent if and only if they commute in $G$. In this article,…
The aim of this paper is to see how commuting graphs interact with two semigroup constructions: the zero-union and the direct product. For both semigroup constructions, we investigate the diameter, clique number, girth, chromatic number and…
A non-commuting graph of a finite group $G$ is a graph whose vertices are non-central elements of $G$ and two vertices are adjacent if they don't commute in $G$. In this paper, we study the non-commuting graph of the group $U_{6n}$ and…
A matching of graph $G$ is maximal if it cannot be expanded by adding any edge to create a larger matching. In this paper, for a hexagonal ring $H$ with $n$ hexagons, we show that the number of maximal matchings of $H$ equals to the trace…
The mixed metric dimension ${\rm mdim}(G)$ of a graph $G$ is the cardinality of a smallest set of vertices that (metrically) resolves each pair of elements from $V(G)\cup E(G)$. We say that $G$ is a max-mdim graph if ${\rm mdim}(G) = n(G)$.…
Let $R$ be a ring with unity. The graph $\Gamma(R)$ is a graph with vertices as elements of $R$, where two distinct vertices $a$ and $b$ are adjacent if and only if $Ra+Rb=R$. Let $\Gamma_2(R)$ is the subgraph of $\Gamma(R)$ induced by the…
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…
We find the exact size of a maximal non-commuting set in unipotent uppertriangular linear group $UU_4(\mathbb{F}_q)$ in terms of a non-commuting geometric structure (Refer Definition [10]), where $\mathbb{F}_q$ is the finite field with $q$…
In this paper, we consider various graphs, namely: power graph, cyclic graph, enhanced power graph and commuting graph, on a finite semigroup $S$. For an arbitrary pair of these four graphs, we classify finite semigroups such that the…
We study the unitary Cayley graph of a matrix semiring. We find bounds for its diameter, clique number and independence number, and determine its girth. We also find the relationship between the diameter and the clique number of a unitary…
In this paper we completely describe the unital compressed commuting graph of the ring $\mathcal{M}_3(\mathrm{GF}(p))$ of $3 \times 3$ matrices over the finite prime field $\mathrm{GF}(p)$. To achieve this we combine methods from linear…
In this paper, we determine the diameter of the commuting involution graphs of special and general linear groups over an arbitrary field. It turns out that our results also determine the diameter for certain projective special linear groups…
Let $G$ be a $p$-group. We begin to consider the relationship between the structure of the commuting graph and $|G:Z(G)|$. We also build a family of groups whose commuting graphs have more than one connected component whose diameter is at…
Let $G$ be a finite insoluble group with soluble radical $R(G)$. In this paper we investigate the soluble graph of $G$, which is a natural generalisation of the widely studied commuting graph. Here the vertices are the elements in $G…
The proper commuting graph $\mathcal{C}^{**}(G)$ of a finite group $G$ is the simple graph whose vertices are the noncentral elements of $G$ and two distinct vertices are adjacent if they commute. In this paper, we study the domination…
In this article we consider commuting graphs of involution conjugacy classes in the affine Weyl group of type $\tilde C_n$. We show that where the graph is connected the diameter is at most $n+2$.