English
Related papers

Related papers: On the Idempotent Graph of Matrix Ring

200 papers

The enhanced power graph of a finite group $G$, denoted by $\mathcal{P}_E(G)$, is the simple undirected graph whose vertex set is $G$ and two distinct vertices $x, y$ are adjacent if $x, y \in \langle z \rangle$ for some $z \in G$. In this…

Group Theory · Mathematics 2022-07-13 Parveen , Jitender Kumar , Siddharth Singh , Xuanlong Ma

For a division ring D, finite dimensional over its center F, we give a condiction for the connectedness of the commuting graph of a matrix ring over $D$. Furthermore, we prove that if the commuting graph is connected, then its diameter is…

Rings and Algebras · Mathematics 2016-10-31 C. Miguel

Let $R$ be a ring with unity. The clean graph $\text{Cl}(R)$ of a ring $R$ is the simple undirected graph whose vertices are of the form $(e,u)$, where $e$ is an idempotent element and $u$ is a unit of the ring $R$ and two vertices $(e,u)$,…

Combinatorics · Mathematics 2024-04-16 Praveen Mathil , Jitender Kumar

Let $R$ be a finite ring and $r\in R$. The $r$-noncommuting graph of $R$, denoted by $\Gamma_R^r$, is a simple undirected graph whose vertex set is $R$ and two vertices $x$ and $y$ are adjacent if and only if $[x,y] \neq r$ and $-r$. In…

Rings and Algebras · Mathematics 2021-08-23 Rajat Kanti Nath , Monalisha Sharma , Parama Dutta , Yilun Shang

The annihilator graph $AG(R)$ of the commutative ring $R$ is an undirected graph with vertex set as the set of all non-zero zero divisors of $R$, and two distinct vertices $x$ and $y$ are adjacent if and only if $ann(xy) \neq ann(x) \cup…

Combinatorics · Mathematics 2024-10-15 Mohd Shariq , Praveen Mathil , Mohd Nazim , Jitender Kumar

Let $R$ be a ring (not necessary commutative) with non-zero identity. The unit graph of $R$, denoted by $G(R)$, is a graph with elements of $R$ as its vertices and two distinct vertices $a$ and $b$ are adjacent if and only if $a+b$ is a…

Rings and Algebras · Mathematics 2016-04-20 S. Akbari , E. Estaji , M. R. Khorsandi

Let $D$ be the ring of integers of a quadratic number field $\mathbb{Q}[\sqrt{d}]$. We study the factorizations of $2 \times 2$ matrices over $D$ into idempotent factors. When $d < 0$ there exist singular matrices that do not admit…

Commutative Algebra · Mathematics 2023-12-14 Laura Cossu , Paolo Zanardo

Let $F$ be a field, char$(F)\neq 2$. Then every finite-dimensional $F$-algebra has either an idempotent or an absolute nilpotent if and only if over $F$ every polynomial of odd degree has a root in $F$. This is also necessary and sufficient…

Rings and Algebras · Mathematics 2014-03-20 Yuri Lyubich , Alexander Tsukerman

In this paper we provide concrete constructions of idempotents to represent typical singular matrices over a given ring as a product of idempotents and apply these factorizations for proving our main results. We generalize works due to…

Rings and Algebras · Mathematics 2013-02-05 Adel Alahmadi , Surender Jain , André Leroy

In this paper we prove that two idempotent rings are Morita equivalent if every corner of one of them is isomorphic to a corner of a matrix ring of the other one. We establish the converse (which is not true in general) for $\sigma$-unital…

Rings and Algebras · Mathematics 2013-10-01 Mercedes Siles Molina , Jose Felix Solanilla Hernandez

Let $L$ be a finite-dimensional Lie algebra over a field $F$. In This paper we introduce the \emph{nilpotent graph} $\Gamma_\mathfrak{N}(L)$ as the graph whose vertices are the elements of $L \setminus \nil(L)$, where \[\nil(L) = \{x \in L…

Rings and Algebras · Mathematics 2025-06-25 David Towers , Ismael Gutierrez , Luis Fernandez

Let $R$ be a commutative ring with $\Z(R)$ its set of zero-divisors. In this paper, we study the total graph of $R$, denoted by $\T(\Gamma(R))$. It is the (undirected) graph with all elements of $R$ as vertices, and for distinct $x, y\in…

Commutative Algebra · Mathematics 2010-02-01 Hamid Reza Maimani , Cameron Wickham , Siamak Yassemi

The non-commuting graph $\Gamma_R$ of a finite ring $R$ with center $Z(R)$ is a simple undirected graph whose vertex set is $R \setminus Z(R)$ and two distinct vertices $a$ and $b$ are adjacent if and only if $ab \ne ba$. In this paper, we…

Rings and Algebras · Mathematics 2017-03-16 J. Dutta , D. K. Basnet

Let $R$ be a commutative ring with unity and $R^{+}$ be $Z^*(R)$ be the additive group and the set of all non-zero zero-divisors of $R$, respectively. We denote by $\mathbb{CAY}(R)$ the Cayley graph $Cay(R^+,Z^*(R))$. In this paper, we…

Combinatorics · Mathematics 2013-05-06 Ghodratollah Aalipour , Saieed Akbari

Consider a finite connected $2$-complex $X$ endowed with a piecewise Riemannian metric and whose fundamental group is freely indecomposable, of rank at least $3$, and in which every $2$-generated subgroup is free. In this paper we show that…

Differential Geometry · Mathematics 2024-03-25 Florent Balacheff , Wolfgang Pitsch

Suppose that $F$ is a finite field and $R=M_n(F)$ is the ring of $n$-square matrices over $F$. Here we characterize when the Cayley graph of the additive group of $R$ with respect to the set of invertible elements of $R$, called the unitary…

Combinatorics · Mathematics 2024-04-11 Shahin Rahimi , Ashkan Nikseresht

The \emph{resistance matrix} of a simple connected graph $G$ is denoted by $R$, and is defined by $R =(r_{ij})$, where $r_{ij}$ is the resistance distance between the vertices $i$ and $j$ of $G$. In this paper, we consider the resistance…

Combinatorics · Mathematics 2018-04-05 Fouzul Atik , Ravindra B Bapat , M. Rajesh Kannan

The inclusion ideal graph of a commutative unitary ring $R$ is the (undirected) graph $In(R)$ whose vertices all non-trivial ideals of $R$ and two distinct vertices are adjacent if and only if one of them is a proper subset of the other…

Combinatorics · Mathematics 2025-06-10 E. Dodongeh , A. Moussavi , R. Nikandish

Let ${\mathbb{D}}^{m\times n}$ be the set of $m\times n$ matrices over a division ring $\mathbb{D}$. Two matrices $A,B\in {\mathbb{D}}^{m\times n}$ are adjacent if ${\rm rank}(A-B)=1$. By the adjacency, ${\mathbb{D}}^{m\times n}$ is a…

Combinatorics · Mathematics 2017-02-21 Li-Ping Huang , Kang Zhao

We introduce the \emph{ID-index} of a finite simple connected graph. For a graph $G=(V,\ E)$ with diameter $d$, we let $f:V\longrightarrow \mathbb{R}$ assign \emph{ranks} to the vertices, then under $f$, each vertex $v$ gets a…

Combinatorics · Mathematics 2024-10-10 Runze Wang