Results 41 to 50 of about 382 (214)
Acid Site Design for Low Hydration Proton Exchange Membranes
α‐CF2 substitution adjacent to sulfonic acid increases acid strength and enables efficient proton transport under low hydration conditions. This molecular design reduces the dependence of hydrocarbon proton exchange membranes on excessive water uptake, addressing a key limitation of conventional hydrocarbon PEMs while maintaining favorable conductivity
Ajay Kumar +10 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
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
Strain Engineering of Magnetoresistance and Magnetic Anisotropy in CrSBr
Biaxial compressive strain significantly enhances magnetoresistance and critical saturation fields in thin flakes of the 2D magnet CrSBr, along all three crystallographic axes. First‐principles calculations link these effects to strain‐induced increases in exchange interactions and magnetic anisotropy.
Eudomar Henríquez‐Guerra +19 more
wiley +1 more source
On Uniquely Hamiltonian Claw-Free and Triangle-Free Graphs
A graph is uniquely Hamiltonian if it contains exactly one Hamiltonian cycle. In this note, we prove that claw-free graphs with minimum degree at least 3 are not uniquely Hamiltonian.
Seamone Ben
doaj +1 more source
AI‐Assisted Workflow for (Scanning) Transmission Electron Microscopy: From Data Analysis Automation to Materials Knowledge Unveiling. Abstract (Scanning) transmission electron microscopy ((S)TEM) has significantly advanced materials science but faces challenges in correlating precise atomic structure information with the functional properties of ...
Marc Botifoll +19 more
wiley +1 more source
Weakly Dimension-Balanced Hamiltonian Cycle on Three-Dimensional Toroidal Mesh Graph
The dimension-balanced cycle (DBC) problem is new in graph theory, with applications such as 3D stereogram reconstruction. In a graph whose edges are partitioned into k dimensions, a cycle is dimension-balanced if edge counts across dimensions differ by ...
Chia-Pei Chu, Justie Su-Tzu Juan
doaj +1 more source
A Note on Cycles in Locally Hamiltonian and Locally Hamilton-Connected Graphs
Let 𝒫 be a property of a graph. A graph G is said to be locally 𝒫, if the subgraph induced by the open neighbourhood of every vertex in G has property 𝒫. Ryjáček conjectures that every connected, locally connected graph is weakly pancyclic.
Tang Long, Vumar Elkin
doaj +1 more source
On pedigree polytopes and Hamiltonian cycles
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources

