Results 31 to 40 of about 350 (134)
A novel characterization of cubic Hamiltonian graphs via the associated quartic graphs [PDF]
We give a necessary and sufficient condition for a cubic graph to be Hamiltonian by analyzing Eulerian tours in certain spanning subgraphs of the quartic graph associated with the cubic graph by 1-factor contraction. This correspondence is most useful in
BONVICINI, Simona, Pisanski, Tomaž
core +1 more source
Scaling turbulence drives the general circulation
The NOAA Gulfstream SP4, which deployed the GPS dropsondes over the NE Pacific Ocean as part of the Winter Storms Project during the January–March periods of 2004, 2005 and 2006. Abstract Statistical multifractal analysis of airborne and dropsonde observations is used to show that persistence of velocity after molecular collisions breaks the continuous
Adrian F. Tuck
wiley +1 more source
Sufficient conditions for a graph to be Hamiltonian [PDF]
Three sufficient conditions for a graph to be Hamiltonian are given. These theorems are in terms of subgraph structure and do not require the fairly high global line density which is basic to the Pósa-like sufficiency conditions.
Hedetniemi, S, Goodman, S
core +1 more source
This paper proposes a dual‐strategy collaborative reinforcement learning path planning method in response to current technical limitations and engineering requirements in concrete 3D printing path planning. A dual‐DQN model was constructed based on the dual strategy collaborative mechanism.
Dan Xu +3 more
wiley +1 more source
IDENTIFY CONNECTIVITY GRAPH USING A MODIFIED PRÜFER’S ALGORITHM LABELLING TREES
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
GLONET: Mercator's End‐to‐End Neural Global Ocean Forecasting System
Abstract Accurate ocean forecasting is crucial in different areas ranging from science to decision making. Recent advancements in data‐driven models have shown significant promise, particularly in weather forecasting community, but yet no data‐driven approaches have matched the accuracy and the scalability of traditional global ocean forecasting ...
Anass El Aouni +7 more
wiley +1 more source
Collapsible graphs and Hamiltonian connectedness of line graphs [PDF]
Thomassen conjectured that every 4-connected line graph is Hamiltonian. Chen and Lai [Z.-H. Chen, H.-J. Lai, Reduction techniques for super-Eulerian graphs and related topics an update, in: Ku Tung-Hsin (Ed.), Combinatorics and Graph Theory, vol.
郭晓峰 +4 more
core +1 more source
Note on Hamiltonicity of Basis Graphs of Even Delta‐Matroids
ABSTRACT We show that the basis graph of an even delta‐matroid is Hamiltonian if it has more than two vertices. More strongly, we prove that for two distinct edges e and f sharing a common end, it has a Hamiltonian cycle using e and avoiding f unless it has at most two vertices or it is a cycle of length at most four.
Donggyu Kim, Sang‐il Oum
wiley +1 more source
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
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

