Results 81 to 90 of about 3,678 (251)
Hamiltonian paths in oriented graphs
Journal of Combinatorial Theory, Series B, 1976 AbstractA short proof is given of Meyniel's theorem on Hamiltonian cycles in oriented graphs. Analogous conditions are obtained for a graph to be Hamiltonianconnected.
openaire +2 more sources
Advanced Science, EarlyView.A multifunctional terahertz (THz) platform is demonstrated, in a model material Fe4Nb2O9, exhibiting a large intrinsic THz phase shift alongside distinct THz magnon excitations in its antiferromagnetic phase. This coexistence of phase modulation and spin dynamics offers a promising pathway toward integrated THz communication and magnonic computation ...
Brijesh Singh Mehra +10 more
wiley +1 more source
Adsorption of Forever Chemical Pollutants: The Physical Chemistry of PFAS Near Surfaces
Advanced Science, EarlyView.Current adsorption‐based remediation techniques for removing per‐ and polyfluoroalkyl substances (PFAS) from water are limited by knowledge gaps on PFAS behavior near solid surfaces. This review provides a state of the art on theoretical and experimental aspects of PFAS adsorption.
Nada Ben Amor +3 more
wiley +1 more source
On the existence of a Hamiltonian path in a graph
Information and Control, 1968 A transition probability matrix is associated with an graph (X, T), and the classification of states in the homogenons Markov chain defined by this transition probability matrix is applied to a graph theory. Several sets of necessary and sufficient conditions for a graph to have a Hamiltonian circuit are obtained by means of the classification of these
openaire +2 more sources
Arc-Disjoint Hamiltonian Cycles in Round Decomposable Locally Semicomplete Digraphs
Discussiones Mathematicae Graph Theory, 2018 Let D = (V,A) be a digraph; if there is at least one arc between every pair of distinct vertices of D, then D is a semicomplete digraph. A digraph D is locally semicomplete if for every vertex x, the out-neighbours of x induce a semicomplete digraph and ...
Li Ruijuan, Han Tingting
doaj +1 more source
Alternating Hamiltonian cycles in $2$-edge-colored multigraphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 A path (cycle) in a $2$-edge-colored multigraph is alternating if no two consecutive edges have the same color. The problem of determining the existence of alternating Hamiltonian paths and cycles in $2$-edge-colored multigraphs is an $\mathcal{NP ...
Alejandro Contreras-Balbuena +2 more
doaj +1 more source
Unconventional Hysteretic Charge Filling in Moiré‐Reconstructed Helical Trilayer Graphene
Advanced Science, EarlyView.In helical trilayer graphene, sequential twisting reconstructs the moiré landscape into periodic domains separated by aperiodic boundaries. Longitudinal transport reveals sweep‐direction‐dependent hysteresis, while the Hall response traces this behavior to hysteretic charge filling at the aperiodic boundaries.
Hangyeol Park +9 more
wiley +1 more source
Field‐Frustrated Cooperative Distortions: Suppressing Jahn‐Teller Ordering via Microwave Annealing
Advanced Science, EarlyView.Microwave annealing decouples local Jahn‐Teller distortions from long‐range cooperative ordering in CuFe2O4, stabilizing a metastable cubic phase that remains locally distorted yet globally symmetry‐frustrated. Synchrotron XRD, PDF, XPS, and in situ thermal cycling reveal how non‐equilibrium MW‐phonon interactions suppress cooperative orbital‐lattice ...
Daryoosh Vashaee, Kelvin Dsouza
wiley +1 more source
Determination of the Shortest Hamiltonian Paths in an Arbitrary Graph of Distributed Databases
Российский технологический журнал, 2019 A method has been developed for finding the shortest Hamiltonian path in an arbitrary graph based on the rank approach, which provides high efficiency and a significant reduction in the error in solving the problem of organizing the process of managing ...
E. G. Andrianova +2 more
doaj +1 more source
AI‐Physics‐Experiment Trinity for Integrated Protein Dynamics Modeling
Advanced Science, EarlyView.This review unites experiments, physics‐based simulations, and AI as a synergistic triad for protein dynamics modeling. It highlights integrative strategies, resolves sampling and forcefield bottlenecks, and outlines challenges and future directions for accurate, interpretable conformational ensemble prediction.
Chen Shi +4 more
wiley +1 more source