Results 11 to 20 of about 24,531 (183)
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
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
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
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
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 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
Zero divisor graphs of semigroups
Let \(S\) be a commutative semigroup with \(0\). A simple graph \(G\) whose vertices are the nonzero zero divisors of \(S\) with two distinct vertices joined by an edge in case when their product in \(S\) is \(0\) is called the zero divisor graph of \(S\). In the paper some characterizations of graphs to be zero divisor graphs of a semigroup are given.
DeMeyer, Frank, DeMeyer, Lisa
openaire +2 more sources
Directed zero-divisor graph and skew power series rings [PDF]
Let $R$ be an associative ring with identity and $Z^{\ast}(R)$ be its set of non-zero zero-divisors. Zero-divisor graphs of rings are well represented in the literature of commutative and non-commutative rings. The directed zero-divisor graph of $R$
Ebrahim Hashemi +2 more
doaj +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
The authors answer two questions about zero divisor graphs posed by \textit{S.~Akbari, H. R.~Maimani} and \textit{S.~Yassemi} [J. Algebra 270, No. 1, 169--180 (2003; Zbl 1032.13014)] and \textit{D.~Anderson, A.~Frazier, A.~Lauve} and \textit{S.~Livingston} [Lect. Notes Pure Appl. Math. 220, 61--72 (2001; Zbl 1035.13004)], respectively.
Belshoff, Richard, Chapman, Jeremy
openaire +1 more source

