中文
相关论文

相关论文: Isomorphism of Clean Graphs over $\mathbb{Z}_n$ an…

200 篇论文

Let $R$ be a finite ring with identity. The idempotent graph $I(R)$ is the graph whose vertex set consists of the non-trivial idempotent elements of $R$, where two distinct vertices $x$ and $y$ are adjacent if and only if $xy = yx = 0$. The…

环与代数 · 数学 2025-05-21 Felicia Servina Djuang , Indah Emilia Wijayanti , Yeni Susanti

Let $R$ be a ring (not necessarily a commutative ring) with identity. The clean graph $Cl(R)$ of a ring $R$ is a graph with vertices in the form of an ordered pair $(e,u)$, where $e$ is an idempotent and $u$ is a unit of ring $R$,…

组合数学 · 数学 2025-11-26 Randhir Singh , S. C. Patekar

Let R be a ring (not necessarily commutative ring) with identity. The clean graph Cl(R) of a ring R is a graph with vertices in the form of ordered pair (e; u), where e is an idempotent of the ring R and u is a unit of the ring R. Two…

组合数学 · 数学 2023-01-24 Randhir Singh , S. C. Patekar

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)$,…

组合数学 · 数学 2024-04-16 Praveen Mathil , Jitender Kumar

Let $R$ be a finite ring with identity. The idempotent graph $I(R)$ is the graph whose vertex set consists of the non-trivial idempotent elements of $R$, where two distinct vertices $x$ and $y$ are adjacent if and only if $xy = yx = 0$. The…

组合数学 · 数学 2026-01-23 Felicia Servina Djuang , Indah Emilia Wijayanti , Yeni Susanti

Let $G = (V, E)$ be a graph with the vertex set $V (G)$ and edge set $E(G)$. The Sombor index of $G$, $SO(G)$, is defined as $\sum_{uv\in E(G)} \sqrt{deg(u)^2 + deg(v)^2}$, where $deg(u)$ is the degree of vertex $u$ in $V (G)$. The clean…

组合数学 · 数学 2025-06-10 M. Badie , R. Nikandish , M. Pirniia

Let $R$ be a ring with unity. The \emph{idempotent graph} $G_{\text{Id}}(R)$ of a ring $R$ is an undirected simple graph whose vertices are the set of all the elements of ring $R$ and two vertices $x$ and $y$ are adjacent if and only if…

组合数学 · 数学 2023-06-16 Praveen Mathil , Barkha Baloda , Jitender Kumar

In this article, we have defined nil clean graph of a ring $R$. The vertex set is the ring $R$, two ring elements $a$ and $b$ are adjacent if and only if $a + b$ is nil clean in $R$. Graph theoretic properties like girth, dominating set,…

环与代数 · 数学 2018-02-21 Dhiren Kumar Basnet , Jayanta Bhattacharyya

In this article, we introduce a new graph theoretic structure associated with a finite commutative ring, called nil clean divisor graph. For a ring $R$, nil clean divisor graph is denoted by $G_N(R)$, where the vertex set is $\{x\in R\,:\,…

环与代数 · 数学 2019-03-07 Ajay Sharma , Dhiren Kumar Basnet

A graph is an instrument which is extensively utilized to model various problems in different fields. Up to date, many graphs have been developed to represent algebraic structures, particularly rings in order to study their properties. In…

组合数学 · 数学 2021-02-25 Mohammad Hassan Mudaber , Nor Haniza Sarmin , Ibrahim Gambo

Let F be a finite field and R = M2(F) be 2x2 matrix ring over F. In this paper, we explicitly determine all the idempotents in R. Using these idempotents, we study the idempotent graph of R whose vertex set is the set of non-trivial…

组合数学 · 数学 2024-02-20 Avinash Patil , P. S. Momale , C. M. Jadhav

Let $R$ be a finite ring with identity. The unit graph (unitary Cayley graph) of $R$ is the graph with vertex set $R$, where two distinct vertices $x$ and $y$ are adjacent exactly whenever $x+y$ is a unit in $R$ ($x-y$ is a unit in $R$).…

组合数学 · 数学 2024-04-11 Shahin Rahimi , Ashkan Nikseresht

We define pure graphs, invertible graphs, and the notion of complementation of bicoloured graphs. The study of pure graphs is motivated by two conjectures about the transition systems of eulerian graphs and by the Cycle Double Cover…

组合数学 · 数学 2007-05-23 François Genest

The unitary Cayley graph $C_R$ of a finite unital ring $R$ is the simple graph with vertex set $R$ in which two elements $x$ and $y$ are connected by an edge if and only if $x-y$ is a unit of $R$. We characterize the unitary Cayley graph…

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…

环与代数 · 数学 2016-04-20 S. Akbari , E. Estaji , M. R. Khorsandi

This paper introduces a new approach to associating a graph with a commutative ring. Let $R$ be a commutative ring with identity. The unit-zero divisor graph of a commutative ring $R$, denoted by $G_{UZ}(R)$, offers a novel framework for…

交换代数 · 数学 2025-06-16 Vika Yugi Kurniawan , Yeni Susanti , Budi Surodjo

Let $R$ be a commutative ring with identity. We introduce a novel bipartite graph $\mathcal{B}(R)$, the \textit{bipartite zero-divisor--unit graph}, whose vertex set is the disjoint union of the nonzero zero-divisors $Z(R)^*$ and the unit…

组合数学 · 数学 2025-11-12 Shahram Mehry , Ali Eisapoor Khasadan

Let $R$ be a commutative ring with unity and $C$ be an $R$-coalgebra. The ring $R$ is clean if every $ r\in R $ is the sum of a unit and an idempotent element of $R$. An $R$-module $M$ is clean if the endomorphism ring of $M$ over $R$ is…

环与代数 · 数学 2022-04-08 Nikken Prima Puspita , Indah Emilia Wijayanti , Budi Surodjo

Color refinement is a classical technique used to show that two given graphs G and H are non-isomorphic; it is very efficient, although it does not succeed on all graphs. We call a graph G amenable to color refinement if it succeeds in…

计算复杂性 · 计算机科学 2015-05-05 V. Arvind , Johannes Köbler , Gaurav Rattan , Oleg Verbitsky

In this paper we introduce and study a graph on the set of ideals of a commutative ring $R$. The vertices of this graph are non-trivial ideals of $R$ and two distinct ideals $I$ and $J$ are adjacent if and only $IJ=I\cap J$. We obtain some…

组合数学 · 数学 2016-02-24 Hamid Reza Dorbidi , Saeid Alikhani
‹ 上一页 1 2 3 10 下一页 ›