Results 31 to 40 of about 183 (122)
IDENTIFY CONNECTIVITY GRAPH USING A MODIFIED PRÜFER’S ALGORITHM LABELLING TREES
Jurnal Natural, 2014 Connectivity of graph easily can be given when we see it with the bare of eyes, but needs an algorithm that can assure the connectivity in computerization.
Al Aiyub, Mahyus Ihsan, Rahma Zuhra
doaj +2 more sources
Energy Science &Engineering, Volume 13, Issue 6, Page 3185-3203, June 2025.The different reflux hole areas. ABSTRACT To investigate the impact of the reflux hole area on the self‐priming performance of a self‐priming pump, this study innovatively established a circulating pipeline system that includes the self‐priming pump, water tank, and other components.
Ying‐Yu Ji +4 more
wiley +1 more source
On the wave turbulence theory of 2D gravity waves, I: Deterministic energy estimates
Communications on Pure and Applied Mathematics, Volume 78, Issue 2, Page 211-322, February 2025.Abstract Our goal in this paper is to initiate the rigorous investigation of wave turbulence and derivation of wave kinetic equations (WKEs) for water waves models. This problem has received intense attention in recent years in the context of semilinear models, such as Schrödinger equations or multidimensional KdV‐type equations. However, our situation
Yu Deng +2 more
wiley +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 +3 more
wiley +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
Eulerian and Hamiltonian properties of Gallai and anti-Gallai middle graphs
, 2022 The Gallai middle graph ΓM(G) of a graph G = (V, E) is the graph whose vertex set is V ∪ E and two edges ei, ej ∈ E are adjacent in ΓM(G), if they are adjacent edges of G and do not lie on a same triangle in G, or if ei = uv ∈ E then ei is adjacent to u and v in ΓM(G).
Goyal, Shanu, Jain, Dilip
openaire +1 more source
Eulertigs: minimum plain text representation of k-mer sets without repetitions in linear time. [PDF]
Algorithms Mol Biol, 2023 Schmidt S, Alanko JN.
europepmc +2 more sources
Eulerian-Hamiltonian Duality: A Structural Unification of Graph Traversals
SÉRGIO DE ANDRADE, PAULO
+4 more sources