Results 51 to 60 of about 889,165 (240)
On pedigree polytopes and Hamiltonian cycles
Discrete Mathematics, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +5 more sources
Hamiltonian cycles in random regular graphs
, 1984 The existence of Hamiltonian cycles in random vertex-labelled regular graphs is investigated. It is proved that there exists r0≤796 such that for r≥r0 almost all vertex-labelled r-regular graphs with n vertices have Hamiltonian cycles as n → ∞
Frieze, A.M., Fenner, Trevor
core +1 more source
Efficient Screening of Organic Singlet Fission Molecules Using Graph Neural Networks
Advanced Science, EarlyView.A high‐throughput screening framework based on graph neural networks (GNNs) and multi‐level validation facilitates the identification of singlet fission (SF) candidates. By efficiently predicting excitation energies across 20 million molecules, and integrating TDDFT calculations, synthetic accessibility assessments, and GW+BSE calculations, this ...
Li Fu +5 more
wiley +1 more source
Advanced Science, EarlyView.Multiferroic order parameters – polarization, magnetization, and ferroelastic strain – are positioned as dynamic design variables for batteries. Their mechanistic roles, practical tuning through fabrication and external fields, and ferroic‐resolved characterization routes are unified into a closed‐loop framework, revealing how coupled ferroic responses
Jiaqi Su +13 more
wiley +1 more source
On the existence of Hamiltonian cycles in hypercubes [PDF]
Notes on Number Theory and Discrete MathematicsBuilding on the results of our previous work on Euclidean leaper tours, considering all integers k>1 and h>0, we study the existence of Hamiltonian cycles in the vertex set C(2,k):={0,1}ᵏ of the k-dimensional hypercube when the Euclidean distance between
Gabriele Di Pietro, Marco Ripà
doaj +1 more source
Polarization Dynamics in Ferroelectrics: Insights Enabled by Machine Learning Molecular Dynamics
Advanced Science, EarlyView.Machine learning molecular dynamics is presented as a route to capture polarization switching, domain wall kinetics, topological polar textures, and polar mechanical coupling beyond the limits of conventional atomistic methods. This Perspective surveys recent progress and identifies key methodological directions, including long‐range electrostatics ...
Dongyu Bai +3 more
wiley +1 more source
Symmetry classes of Hamiltonian cycles
CoRR27 pages, 13 ...
Júlia Baligács +3 more
openaire +4 more sources
On the Number of Hamiltonian Cycles in Bipartite Graphs
, 1996 We prove that a bipartite uniquely Hamiltonian graph has a vertex of degree 2 in each color class. As consequences, every bipartite Hamiltonian graph of minimum degree d has at least 21-dd!
Thomassen, Carsten
core +1 more source
Plaid‐Like Spin Splitting and Chirality of Magnon Bands in Antiferromagnetic MnTe2
Advanced Science, EarlyView.Helicity‐ and angle‐resolved Raman spectroscopy reveals chiral magnons in the non‐coplanar antiferromagnet MnTe 2. Combined with first‐principles calculations and spin‐wave theory, the results establish its altermagnetic character through circular Raman dichroism, reduced rotational symmetry, and a distinctive plaid‐like momentum‐space magnon spin ...
Dirk Wulferding +10 more
wiley +1 more source
Constructing arbitrarily large graphs with a specified number of Hamiltonian cycles
Electronic Journal of Graph Theory and Applications, 2016 A constructive method is provided that outputs a directed graph which is named a broken crown graph, containing $5n-9$ vertices and $k$ Hamiltonian cycles for any choice of integers $n \geq k \geq 4$. The construction is not designed to be minimal in any
Michael Haythorpe
doaj +1 more source