نتایج جستجو برای: zero divisor graph

تعداد نتایج: 343463  

2009
Ivana Božić Zoran Petrović

The concept of a zero-divisor graph of a commutative ring was first introduced in Beck (1988), and later redefined in Anderson and Livingston (1999). Redmond (2002) further extended this concept to the noncommutative case, introducing several definitions of a zero-divisor graph of a noncommutative ring. Recently, the diameter and girth of polynomial and power series rings over a commutative rin...

Journal: :International Journal of Combinatorics 2014

Journal: :international journal of group theory 0
seyed ali moosavi university of qom

‎the concept of the bipartite divisor graph for integer subsets has been considered in [‎m‎. ‎a‎. ‎iranmanesh and c‎. ‎e‎. ‎praeger‎, ‎bipartite divisor graphs for integer subsets‎, ‎{em graphs combin.}‎, ‎{bf 26} (2010) 95--105‎.]‎. ‎in this paper‎, ‎we will consider this graph for the set of character degrees of a finite group $g$ and obtain some properties of this graph‎. ‎we show that if $g...

A. Mahmoodi

Let $R$ be a ring with unity. The undirected nilpotent graph of $R$, denoted by $Gamma_N(R)$, is a graph with vertex set ~$Z_N(R)^* = {0neq x in R | xy in N(R) for some y in R^*}$, and two distinct vertices $x$ and $y$ are adjacent if and only if $xy in N(R)$, or equivalently, $yx in N(R)$, where $N(R)$ denoted the nilpotent elements of $R$. Recently, it has been proved that if $R$ is a left A...

Journal: :Discrete Mathematics 2009
Dancheng Lu Tongsuo Wu

A (finite or infinite) complete bipartite graph together with some end vertices all adjacent to a common vertex is called a complete bipartite graph with a horn. For any bipartite graph G, we show that G is the graph of a commutative semigroup with 0 if and only if it is one of the following graphs: star graph, two-star graph, complete bipartite graph, complete bipartite graph with a horn. We a...

Journal: :Communications in Mathematics and Applications 2023

The detour pebbling number of a graph \(G\) is the least positive integer \(f^{*}(G)\) such that these pebbles are placed on vertices \(G\), we can move pebble to target vertex by sequence moves each taking two off and placing one an adjacent using path. In this paper, compute for commutative ring zero-divisor graphs, sum product zero divisor graphs.

Journal: :Mathematical Problems in Engineering 2022

Let R be a commutative ring and let ? Z n the zero divisor graph of id="M2"> R , whose vertices are nonzero divisors id="M3"> such that two id="M4"> u , v adjacen...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید