Results 101 to 110 of about 52,480 (200)
The Hamiltonian and Hypohamiltonian of Generalized Petersen Graph (GP_(n,9))
Jambura Journal of MathematicsThe study of Hamiltonian and Hypohamiltonian properties in the generalized Petersen graph GP_{n,k} is interesting due to the unique structure and characteristics of these graphs. The method employed in this study involves searching for Hamiltonian cycles
Susilawati Susilawati +3 more
doaj +1 more source
Decomposing the Complete Graph Into Hamiltonian Paths (Cycles) and 3-Stars
Discussiones Mathematicae Graph Theory, 2020 Let H be a graph. A decomposition of H is a set of edge-disjoint subgraphs of H whose union is H. A Hamiltonian path (respectively, cycle) of H is a path (respectively, cycle) that contains every vertex of H exactly once.
Lee Hung-Chih, Chen Zhen-Chun
doaj +1 more source
Advanced Intelligent Systems, EarlyView.This study refines the Crystal Hamiltonian Graph Network to predict energies, structures, and lithium‐ion dynamics in halide electrolytes. By generating ordered structural models and using an iterative fine‐tuning workflow, we achieve near‐ab initio accuracy for phase stability and ionic transport predictions.
Jonas Böhm, Aurélie Champagne
wiley +1 more source
Bifurcation of Limit Cycles by Perturbing a Piecewise Linear Hamiltonian System
Abstract and Applied Analysis, 2013 This paper concerns limit cycle bifurcations by perturbing a piecewise linear Hamiltonian system. We first obtain all phase portraits of the unperturbed system having at least one family of periodic orbits.
Yanqin Xiong, Maoan Han
doaj +1 more source
When the Cartesian product of directed cycles is hyper-Hamiltonian [PDF]
Discrete Mathematics Letters, 2021 Zbigniew R. Bogdanowicz
doaj +1 more source
Change ringing and Hamiltonian cycles: The search for Erin and Stedman triples
Electronic Journal of Graph Theory and Applications, 2019 A very old problem in campanology is the search for peals. The latter can be thought of as a heavily constrained sequence of all possible permutations of a given size, where the exact nature of the constraints depends on which method of ringing is ...
Michael Haythorpe, Andrew Johnson
doaj +1 more source
, 2013 Historically, the minimal length Hamiltonian cycles in a random point cloud lying inside a given rectangle are computed by partitioning this rectangle. We have used successive convex hulls of the set of points, in order to obtain partitions better suited for this purpose.
de Arriba Perez, Francisco +2 more
openaire +1 more source
Interfacial Ru–O–W Orbital Coupling Enables Lattice Oxygen Stabilization for Enhanced Acidic OER
Carbon Energy, EarlyView.A RuO2/WO3 electrocatalyst with strong interfacial Ru–O–W bonds exhibits optimized Ru–O interactions, enhancing intrinsic activity and stability for acidic OER. The WO3 support modulates the electronic structure of RuO2 and promotes oxo‐intermediate deprotonation, delivering a low overpotential of 203 mV at 10 mA cm−2 and sustained operation beyond 200
Tongzhou Wang +9 more
wiley +1 more source
Carbon Energy, EarlyView.A Se‐mediated Co dual‐atom catalyst replaces sluggish oxygen evolution with efficient iodide oxidation in zinc‐air/iodide hybrid batteries. Se‐induced d‐p orbital hybridization optimizes adsorption, enabling a low 0.365 V voltage gap and superior durability, fundamentally overcoming conventional kinetic bottlenecks.
Huaipeng Pang +6 more
wiley +1 more source
Disjoint hamiltonian cycles in bipartite graphs
Discrete Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ferrara, Michael +3 more
openaire +2 more sources