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

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

Journal: :Revista de la Unión Matemática Argentina 2021

2012
MOJGAN AFKHAMI KAZEM KHASHYARMANESH K. Khashyarmanesh

Let R be a commutative ring with non-zero identity. The cozero-divisor graph of R, denoted by Γ′(R), is a graph with vertices in W ∗(R), which is the set of all non-zero and non-unit elements of R, and two distinct vertices a and b in W ∗(R) are adjacent if and only if a / ∈ bR and b / ∈ aR. In this paper, we characterize all commutative rings whose cozero-divisor graphs are forest, star, doubl...

Journal: :EJGTA 2016
Ebrahim Vatandoost Fatemeh Ramezani

Let R be a commutative ring (with 1) and let Z(R) be its set of zero-divisors. The zero-divisor graph Γ(R) has vertex set Z∗(R) = Z(R) \ {0} and for distinct x, y ∈ Z∗(R), the vertices x and y are adjacent if and only if xy = 0. In this paper, we consider the domination number and signed domination number on zero-divisor graph Γ(R) of commutative ring R such that for every 0 6= x ∈ Z∗(R), x 6= ...

Journal: :Australasian J. Combinatorics 1996
Ngo Dac Tan

continue to investigate the problem of the existence of a Hamilton connected cubic (m,n)-metacirculant graphs. We show that a connected cubic (m,n)-metacirculant graph G = MC(m, n, a, So, ,.., has Hamilton cycle if either a 2 == 1 (mod n) or in the case of an odd number f.L one of the numbers (a 1) or a + a 2 _ ... ajJ.-2 + ajJ.-l) relatively to n. As a corollary of results we obtain that every...

Journal: :J. Comb. Theory, Ser. A 2013
Jan Hladký Daniel Král Serguei Norine

We investigate, using purely combinatorial methods, structural and algorithmic properties of linear equivalence classes of divisors on tropical curves. In particular, an elementary proof of the RiemannRoch theorem for tropical curves, similar to the recent proof of the Riemann-Roch theorem for graphs by Baker and Norine, is presented. In addition, a conjecture of Baker asserting that the rank o...

Journal: :Discrete Mathematics 2015
Vinayak Joshi Sachin Sarode

In this paper, we introduce the multiplicative zero-divisor graph of a multiplicative lattice and study Beck-like coloring of such graphs. Further, it is proved that for such graphs, the chromatic number and the clique number need not be equal. On the other hand, if a multiplicative lattice L is reduced, then the chromatic number and the clique number of the multiplicative zero-divisor graph of...

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...

2006
YANGJING LONG YIZHEN HUANG Y. Huang

The idea of associating a graph with the zero-divisors of a commutative ring was originated by Beck. The problems concerning zero-divisor graphs have been studied extensively in the past 10 years. DeMeyer and DeMeyer presented some properties for the correspondence between zero-divisor graphs and their semigroups. It is very important to have adequate examples before the complete resolution of ...

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

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