Related papers: On the Idempotent Graph of Matrix Ring

The Zero divisor Graph of a commutative ring $R$, denoted by $\Gamma[R]$, is a graph whose vertices are non-zero zero divisors of $R$ and two vertices are adjacent if their product is zero. In this paper, we consider the zero divisor graph…

Intuitively speaking, a bipartite graph is mirror if it can be drawn in the Cartesian plane in such a way that, the vertices of one stable are points in x=0, the vertices of the other stable set are points in x=1, the edges are straight…

A unimodular $2\times 2$ matrix with entries in a commutative $R$ is called extendable (resp.\ simply extendable) if it extends to an invertible $3\times 3$ matrix (resp.\ invertible $3\times 3$ matrix whose $(3,3)$ entry is $0$). We obtain…

Rotary maps (orientably regular maps) are highly symmetric graph embeddings on orientable surfaces. This paper classifies all rotary maps whose underlying graphs are Praeger-Xu graphs, denoted $\operatorname{C}(p,r,s)$, for any odd prime…

Let $R$ be a ring with unity. The cozero-divisor graph of a ring $R$ is an undirected simple graph whose vertices are the set of all non-zero and non-unit elements of $R$ and two distinct vertices $x$ and $y$ are adjacent if and only if $x…

As a discrete analogue of Kac's celebrated question on "hearing the shape of a drum", and towards a practical graph isomorphism test, it is of interest to understand which graphs are determined up to isomorphism by their spectrum (of their…

Let $G$ be a finite simple graph and let $I_G$ denote its associated toric ideal in the polynomial ring $R$. For each integer $n\geq 2$, we completely determine all the possible values for the tuple $({\rm reg}(R/I_G), {\rm…

We present three equivalence classes of rational non-invertible multidimensional compatible maps. These maps turns out to be idempotent and by construction they admit birational partial inverses (companion maps) which are Yang-Baxter maps.…

An element $a\in R$ is provided that there exists an idempotent $e\in R$ such that $a-e\in U(R), ae=ea$ and $eae\in J(eRe)$. In this article, we investigate strongly rad-clean matrices over a commutative local ring. We completely determine…

A mixed graph $\widetilde{G}$ is obtained by orienting some edges of a graph $G$, where $G$ is the underlying graph of $\widetilde{G}$. Let $r(\widetilde{G})$ be the $H$-rank of $\widetilde{G}$. Denote by $r(G)$, $\kappa(G)$, $m(G)$ and…

Let $G$ be a group and let $R$ be a $G$-graded ring. We show that a nonzero central idempotent in $R$ has finite support group in two broad settings: when $G$ is abelian, and when $G$ is arbitrary but the grading satisfies a certain…

Some of the classical results of Ramsey Theory can be naturally stated in terms of image partition regularity of matrices. There have been many significant results of image partition regular matrices as well as image partition regular…

The nilpotent graph of a group $G$ is the simple and undirected graph whose vertices are the elements of $G$ and two distinct vertices are adjacent if they generate a nilpotent subgroup of $G$. Here we discuss some topological properties of…

Let $ \Phi=(G, \varphi) $ be a connected complex unit gain graph ($ \mathbb{T} $-gain graph) on a simple graph $ G $ with $ n $ vertices and maximum vertex degree $ \Delta $. The associated adjacency matrix and degree matrix are denoted by…

An element $a\in R$ is very clean provided that there exists an idempotent $e\in R$ such that $ae=ea$ and either $a-e$ or $a+e$ is invertible. A ring $R$ is very clean in case every element in $R$ is very clean. We explore the necessary and…

Let $R$ be a ring with unity. The upper ideal relation graph $\Gamma_U(R)$ of the ring $R$ is a simple undirected graph whose vertex set is the set of all non-unit elements of $R$ and two distinct vertices $x, y$ are adjacent if and only if…

A ring R is a Zhou nil-clean ring if every element in R is the sum of two tripotents and a nilpotent that commute. In this paper, Zhou nil-clean rings are further discussed with an emphasis on their relations with polynomials, idempotents…

Let $R$ be a ring with unity. The cozero-divisor graph of a ring $R$, denoted by $\Gamma'(R)$, is an undirected simple graph whose vertices are the set of all non-zero and non-unit elements of $R$, and two distinct vertices $x$ and $y$ are…

Let $k$ be a commutative ring with identity. A {\it $k$-plethory} is a commutative $k$-algebra $P$ together with a comonad structure $W_P$, called the {\it $P$-Witt ring} functor, on the covariant functor that it represents. We say that a…

A graph is pseudo 2-factor isomorphic if all of its 2-factors have the same parity of number of cycles. Abreu et al. [J. Comb. Theory, Ser. B. 98 (2008) 432--442] conjectured that $K_{3,3}$, the Heawood graph and the Pappus graph are the…