Results 51 to 60 of about 1,982,910 (295)
Discrete exterior geometry approach to structure-preserving discretization of distributed-parameter port-Hamiltonian systems [PDF]
This paper addresses the issue of structure-preserving discretization of open distributed-parameter systems with Hamiltonian dynamics. Employing the formalism of discrete exterior calculus, we introduce a simplicial Dirac structure as a discrete analogue
Seslija, Marko, +11 more
core +3 more sources
Numerical evidence for phase transitions of NP-complete problems for instances drawn from Lévy-stable distributions [PDF]
Random NP-Complete problems have come under study as an important tool used in the analysis of optimization algorithms and help in our understanding of how to properly address issues of computational intractability.
Connelly, Abram, Abram Connelly
core +2 more sources
On the H-Force Number of Hamiltonian Graphs and Cycle Extendability
The H-force number h(G) of a hamiltonian graph G is the smallest cardinality of a set A ⊆ V (G) such that each cycle containing all vertices of A is hamiltonian. In this paper a lower and an upper bound of h(G) is given.
Hexel Erhard
doaj +1 more source
Enforced hamiltonian cycles in generalized dodecahedra
The H-force number of a hamiltonian graph G is the smallest number k with the property that there exists a set W ⊆ V (G) with |W| = k such that each cycle passing through all vertices of W is a hamiltonian cycle.
Maria Timkova
doaj +1 more source
Polarizable Vanadium Dipoles Promote Water Dissociation on Vanadium‐Based Metal Organic Framework
The polarization of unpaired V 3d electrons weakens the H─O bond to improve water dissociation by the dual Vδ+:O─H and Pλ−:H─O coupling hydrogen bonds formation and relaxation. P@V‐MOF electrocatalyst shows low overpotentials (94 mV in acid, 178 mV in neutral, and 77 mV in alkaline solutions) with excellent stability for effective overall water ...
Xinjuan Liu +13 more
wiley +1 more source
Fan's condition on induced subgraphs for circumference and pancyclicity [PDF]
Let \(\mathcal{H}\) be a family of simple graphs and \(k\) be a positive integer. We say that a graph \(G\) of order \(n\geq k\) satisfies Fan's condition with respect to \(\mathcal{H}\) with constant \(k\), if for every induced subgraph \(H\) of \(G ...
Wojciech Wideł
doaj +1 more source
Covalent Functionalization of 2D Semiconductors: A Roadmap to Advanced Electronic Devices
This Review presents recent advances in the covalent functionalization strategies for two‐dimensional semiconductors and their implementation in modern technologies. Layered materials are modified through diverse molecular chemistries (e.g., thiols, diazonium salts, alkyl halides, and electron‐deficient species) to tailor their surface properties ...
Ramiro Quirós‐Ovies +2 more
wiley +1 more source
Hamiltonian paths on Platonic graphs
We develop a combinatorial method to show that the dodecahedron graph has, up to rotation and reflection, a unique Hamiltonian cycle. Platonic graphs with this property are called topologically uniquely Hamiltonian. The same method is used to demonstrate
Brian Hopkins
doaj +1 more source
Energy Conditions for Hamiltonian and Traceable Graphs
A graph is called Hamiltonian (resp. traceable) if the graph has a Hamiltonian cycle (resp. path), a cycle (resp. path) containing all the vertices of the graph. The energy of a graph is defined as the sum of the absolute values of the eigenvalues of the
Rao Li
doaj +1 more source
A Nb‐proximitized Josephson junction based on a WTe2/α‐Fe2O3 heterostructure exhibits a robust superconducting diode effect with programmable polarity. The diode direction can be trained by magnetic fields and switched by temperature cycling, revealing tunable finite‐momentum pairing states and competing superconducting states in symmetry‐broken ...
Enze Zhang +9 more
wiley +1 more source

