Results 41 to 50 of about 280 (99)
On the Clean Graph of Commutative Artinian Rings
International Journal of Mathematics and Mathematical Sciences, Volume 2025, Issue 1, 2025.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
Al-Rafidain Journal of Computer Sciences and MathematicsIn 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
Advanced Intelligent Systems, Volume 6, Issue 9, September 2024.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
IET Control Theory &Applications, Volume 18, Issue 6, Page 814-824, April 2024.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
Indoor Air, Volume 2024, Issue 1, 2024.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
Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs [PDF]
, 2009 The Hamiltonian Cycle problem asks if an $n$-vertex graph $G$ has a cycle passing through all vertices of $G$. This problem is a classic $NP$-complete problem.
Fomin, F. V. +11 more
core +1 more source
Eulerian subgraphs containing given vertices and hamiltonian line graphs
Discrete Mathematics, 1998 Let \(G\) be a graph and let \(D_1(G)\) be the set of vertices of degree 1 in \(G\). A graph is called an eulerian graph if it is connected and every vertex has even degree. An eulerian subgraph \(H\) of a graph \(G\) is called a dominating eulerian subgraph if \(G-V(H)\) is edgeless.
openaire +1 more source
Some characterizations of Eulerian and Hamiltonian graphs
, 2006 The thesis is an exposition of some characterization of Eulerian and Hamiltonian graphs. It discusses the definitions of an Eulerian graph, Hamiltonian graph and examples, a necessary and sufficient condition for a graph to be Eulerian, a necessary and ...
Ong, Hans Vernie L. +1 more
core
, 2016 Graph theory is about collections of points that are joined in pairs, such as a road map with towns connected by roads or a molecule with atoms joined by chemical bonds. ‘Graphs’ revisits the Königsberg bridges problem, the knight’s tour problem, the Gas–
Robin Wilson
core +1 more source
A study on Dicycles and Eulerian Subdigraphs [PDF]
, 2016 1. Dicycle cover of Hamiltonian oriented graphs. A dicycle cover of a digraph D is a family F of dicycles of D such that each arc of D lies in at least one dicycle in F. We investigate the problem of determining the upper bounds for the minimum number of
Alsatami, Khalid A.
core +1 more source