Results 11 to 20 of about 17,702 (242)
Zero-divisor graphs and zero-divisor functors
Inspired by a very recent work of A. Đurić, S. Jevđenić and N. Stopar, we introduce a new definition of zero-divisor graphs attached to rings that includes all of the classical definitions already known in the literature. We provide an interpretation of such graphs by means of a functor that we call zero-divisor functor and which is associated with a ...
Enrico Sbarra, Maurizio Zanardo
openaire +3 more sources
Hardware acceleration of number theoretic transform for zk‐SNARK
An FPGA‐based hardware accelerator with a multi‐level pipeline is designed to support the large‐bitwidth and large‐scale NTT tasks in zk‐SNARK. It can be flexibly scaled to different scales of FPGAs and has been equipped in the heterogeneous acceleration system with the help of HLS and OpenCL.
Haixu Zhao +6 more
wiley +1 more source
Classification of Zero Divisor Graphs of Commutative Rings of Degrees 11,12 and 13 [PDF]
In 2005 Wang investigated the zero divisor graphs of degrees 5,6,9 and 10. In 2012 Shuker and Mohammad investigated the zero divisor graphs of degrees 7 and 8. In this paper, we consider zero divisor graphs of commutative rings of degrees 11, 12 and 13.
Nazar Shuker, Husam Mohammad
doaj +1 more source
On graphs with equal coprime index and clique number
Recently, Katre et al. introduced the concept of the coprime index of a graph. They asked to characterize the graphs for which the coprime index is the same as the clique number. In this paper, we partially solve this problem.
Chetan Patil +2 more
doaj +1 more source
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
Quotient Energy of Zero Divisor Graphs And Identity Graphs
Consider the (p,q) simple connected graph . The sum absolute values of the spectrum of quotient matrix of a graph make up the graph's quotient energy.
M. Lalitha Kumari +2 more
doaj +1 more source
Zero-divisor ideals and realizable zero-divisor graphs [PDF]
We seek to classify the sets of zero-divisors that form ideals based on their zero-divisor graphs. We offer full classification of these ideals within finite commutative rings with identity. We also provide various results concerning the realizability of a graph as a zero-divisor graph. 1.
Axtell, Michael +2 more
openaire +3 more sources
Classification of Zero Divisor Graphs of a Commutative Ring With Degree Equal 7 and 8 [PDF]
In 2005 J. T Wang investigated the zero divisor graphs of degrees 5 and 6. In this paper, we consider the zero divisor graphs of a commutative rings of degrees 7 and 8.
Nazar Shuker, Husam Mohammad
doaj +1 more source
On distance signless Laplacian eigenvalues of zero divisor graph of commutative rings
For a simple connected graph $ G $ of order $ n $, the distance signless Laplacian matrix is defined by $ D^{Q}(G) = D(G) + Tr(G) $, where $ D(G) $ and $ Tr(G) $ is the distance matrix and the diagonal matrix of vertex transmission degrees, respectively.
Bilal A. Rather +4 more
doaj +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

