Results 41 to 50 of about 350 (134)

Eulerian subgraphs and Hamiltonicity of claw -free graphs [PDF]

, 2003
Let C(l, k) denote the class of 2-edge-connected graphs of order n such that a graph G ∈ C(l, k) if and only if for every edge cut S ⊆ E(G) with |S| ≤ 3, each component of G - S has order at least n-kl .
Zhan, Mingquan
core   +1 more source

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, M. Habibi, S. C. Patekar, Anwar Saleh Alwardi   +3 more
wiley   +1 more source

The Structure of Tripotent Graph of Certain Commutative Rings

Al-Rafidain Journal of Computer Sciences and Mathematics
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

Navigating Intelligence: A Survey of Google OR‐Tools and Machine Learning for Global Path Planning in Autonomous Vehicles

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

Pairwise display of high dimensional information via Eulerian tours and Hamiltonian decompositions [PDF]

, 2010
A graph theoretic approach is taken to the component order problem in the layout of statistical graphics. Eulerian tours and Hamiltonian decompositions of complete graphs are used to ameliorate order effects in statistical graphics.
C. B. Hurley, R. W. Oldford, Oldfield, R.W., Hurley, Catherine B.   +3 more
core   +1 more source

Study on the Effects of Dust Particle Size and Respiratory Intensity on the Pattern of Respiratory Particle Deposition in Humans

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, Zengxin Liu, Wenqi Shao, Biao Sun, Lin Li, Jianguo Liu, Gang Li, Xueqiang Lv, Xiaohu Yang   +8 more
wiley   +1 more source

Riordan graphs I : structural properties [PDF]

, 2019
In this paper, we use the theory of Riordan matrices to introduce the notion of a Riordan graph. The Riordan graphs are a far-reaching generalization of the well known and well studied Pascal graphs and Toeplitz graphs, and also some other fami- lies of ...
Jung, Ji-Hwan, Mojallal, Seyed Ahmad, Cheon, Gi-Sang, Kitaev, Sergey   +3 more
core   +3 more sources

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., Andrada, Philip Gabriel Y.   +1 more
core  

Finding Hamiltonian circuits in quasi-adjoint graphs

This paper is motivated by a method used for DNA sequencing by hybridization presented in [Jacek Blazewicz, Marta Kasprzak, Computational complexity of isothernnic DNA sequencing by hybridization, Discrete Appl. Math. 154 (5) (2006) 718-7291.
Kasprzak, Marta, Leroy-Beaulieu, Benjamin, Blazewicz, Jacek, de Werra, Dominique   +3 more
core   +1 more source