Results 31 to 40 of about 157 (110)
On the Clean Graph of Commutative Artinian Rings
For a commutative Artinian ring R with unity, the clean graph Cl(R) is a graph with vertices in the form of an ordered pair (e, u), where e is an idempotent and u is a unit of ring R, respectively. Two distinct vertices (e, u) and (f, v) are adjacent in Cl(R) if and only if ef = fe = 0 or uv = vu = 1.
R. Singh +3 more
wiley +1 more source
The Structure of Tripotent Graph of Certain Commutative Rings
In this paper, we characterize the texture of tripotent graph of the ring, which is associated by tripotent element of a ring such that, for every two distinct vertices; and then, their adjacent if and only if.
Parween O. Ali, Shaymaa Essa
doaj +1 more source
Advancing global path planning algorithm is studied for transforming geochemical mining sampling in autonomous vehicles. Cutting‐edge algorithms are harnessed to solve the intricate traveling salesman problem, optimizing route efficiency. A novel analysis of operations research‐tools and reinforcement learning techniques is investigated, demonstrating ...
Alexandre Benoit, Pedram Asef
wiley +1 more source
An adaptive neural design for planar rigid formation of three coleaders in unknown flowfields
This article deals with the robust planar rigid formation control problem of three second‐order coleaders with unknown flowfields acting on the velocity and acceleration respectively. To yield the uniform boundedness property of the resulting system, an adaptive projection is introduced to design the novel adaptive neural control law.
Weibin Chen, Peng Xu, Yang‐Yang Chen
wiley +1 more source
Nowadays, dust exposure pollution is receiving a lot of attention due to its significant impact on public health. To investigate the impact of dust particle size and human respiratory strength on respiratory particle deposition patterns, data was collected through on‐site surveys. The study analyzed the equivalent respiratory strength, dust environment
Gang Zhou +8 more
wiley +1 more source
Eulertigs: minimum plain text representation of k-mer sets without repetitions in linear time. [PDF]
Schmidt S, Alanko JN.
europepmc +2 more sources
Continuous-time quantum walk based centrality testing on weighted graphs. [PDF]
Wang Y, Xue S, Wu J, Xu P.
europepmc +1 more source
Quantum computing algorithms: getting closer to critical problems in computational biology. [PDF]
Marchetti L +8 more
europepmc +1 more source
Mathematical Investigation of Eulerian and Hamiltonian Graphs in Complex Networks
This study investigates the properties and applications of Eulerian and Hamiltonian graphs within complex networks, with a particular focus on their roles in transportation, communication, and biological systems. The primary objective is to develop a deeper mathematical understanding of these graph structures and their implications for optimizing ...
openaire +1 more source
Flip Distances Between Graph Orientations. [PDF]
Aichholzer O +6 more
europepmc +1 more source

