Results 11 to 20 of about 456 (184)
Dynamic multi‐objective optimisation of complex networks based on evolutionary computation
Abstract As the problems concerning the number of information to be optimised is increasing, the optimisation level is getting higher, the target information is more diversified, and the algorithms are becoming more complex; the traditional algorithms such as particle swarm and differential evolution are far from being able to deal with this situation ...
Linfeng Huang
wiley +1 more source
Comments on the Clique Number of Zero-Divisor Graphs of Zn
In 2008, J. Skowronek-kazio´w extended the study of the clique number ωGZn to the zero-divisor graph of the ring Zn, but their result was imperfect. In this paper, we reconsider ωGZn of the ring Zn and give some counterexamples. We propose a constructive
Yanzhao Tian, Lixiang Li
doaj +1 more source
Wiener index of graphs over rings: a survey
This article presents a survey of results consisting of the Wiener index of graphs associated with commutative rings. In particular, we focus on zero-divisor graphs, unit graphs, total graphs and prime graphs.
T. Asir +3 more
doaj +1 more source
A Zero Divisor Graph Determined by Equivalence Classes of Zero Divisors [PDF]
We study the zero divisor graph determined by equivalence classes of zero divisors of a commutative Noetherian ring R. We demonstrate how to recover information about R from this structure. In particular, we determine how to identify associated primes from the graph.
Spiroff, Sandra, Wickham, Cameron
openaire +2 more sources
On distance Laplacian spectrum of zero divisor graphs of the ring $\mathbb{Z}_{n}$
For a finite commutative ring $\mathbb{Z}_{n}$ with identity $1\neq 0$, the zero divisor graph $\Gamma(\mathbb{Z}_{n})$ is a simple connected graph having vertex set as the set of non-zero zero divisors, where two vertices $x$ and $y$ are adjacent if and
S. Pirzada, B.A. Rather, T.A. Chishti
doaj +1 more source
GENERALIZATIONS OF THE ZERO-DIVISOR GRAPH
Summary: Let \(R\) be a commutative ring with \(1\neq 0\) and \(Z(R)\) its set of zerodivisors. The zero-divisor graph of \(R\) is the (simple) graph \(\Gamma \)(R) with vertices \(Z(R) \backslash \{0\}\), and distinct vertices \(x\)and \(y\) are adjacent if and only if \(xy= 0\).
ANDERSON, David F., MCCLURKİN, Grace
openaire +4 more sources
THE ZERO-DIVISOR GRAPHS OF RINGS AND SEMIRINGS [PDF]
In this paper we study zero-divisor graphs of rings and semirings. We show that all zero-divisor graphs of (possibly noncommutative) semirings are connected and have diameter less than or equal to 3. We characterize all acyclic zero-divisor graphs of semirings and prove that in the case zero-divisor graphs are cyclic, their girths are less than or ...
David Dolzan, Polona Oblak
openaire +1 more source
Distances in zero-divisor and total graphs from commutative rings–A survey
There are so many ways to construct graphs from algebraic structures. Most popular constructions are Cayley graphs, commuting graphs and non-commuting graphs from finite groups and zero-divisor graphs and total graphs from commutative rings.
T. Tamizh Chelvam, T. Asir
doaj +1 more source
Exploring the properties of the zero-divisor graph of direct product of $\ast$-rings [PDF]
In this paper, we delve into the study of zero-divisor graphs in rings equipped with an involution. Specifically, we focus on abelian Rickart $\ast$-rings.
Mohd Nazim +2 more
doaj +1 more source
The field of mathematics that studies the relationship between algebraic structures and graphs is known as algebraic graph theory. It incorporates concepts from graph theory, which examines the characteristics and topology of graphs, with those from ...
Amal S. Alali +5 more
doaj +1 more source

