Results 71 to 80 of about 1,859,854 (274)

Atomically Dispersed Transition Metals on Holey Graphyne as an Efficient Electrocatalyst for Nitrogen Reduction Reactions

open access: yesAdvanced Energy and Sustainability Research, EarlyView.
Transition metal‐decorated holey graphyne (TM@hGY) catalysts are evaluated for electrochemical nitrogen reduction. Cr@hGY demonstrates exceptional catalytic activity with a limiting potential of −0.34 V, exhibiting high selectivity for ammonia synthesis and low hydrogen evolution, offering a promising strategy for efficient, sustainable ammonia ...
Mihir Ranjan Sahoo   +3 more
wiley   +1 more source

Hamiltonian path of Mk -V

open access: yesRevista Técnica de la Facultad de Ingeniería, 2011
Véase archivo ...
Eduardo Montenegro   +1 more
doaj  

Hamiltonian paths in odd graphs [PDF]

open access: yesApplicable Analysis and Discrete Mathematics, 2009
Lov?sz conjectured that every connected vertex-transitive graph has a Hamiltonian path. The odd graphs Ok form a well-studied family of connected, k-regular, vertex-transitive graphs. It was previously known that Ok has Hamiltonian paths for k ? 14. A direct computation of Hamiltonian paths in Ok is not feasible for large values of k, because Ok has ...
Letícia Bueno   +3 more
openaire   +1 more source

Limitations of Foundation Models in Energy Materials Simulations: A Case Study in Polyanion Sodium Cathode Materials

open access: yesAdvanced Intelligent Discovery, EarlyView.
Several simulation techniques are used to explore static and dynamic behavior in polyanion sodium cathode materials. The study reveals that universal machine learning interatomic potentials (MLIPs) struggle with system‐specific chemistry, emphasizing the need for tailored datasets.
Martin Hoffmann Petersen   +5 more
wiley   +1 more source

Alternating Hamiltonian cycles in $2$-edge-colored multigraphs [PDF]

open access: yesDiscrete 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

Hamiltonian paths in infinite graphs [PDF]

open access: yesProceedings of the twenty-third annual ACM symposium on Theory of computing - STOC '91, 1991
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Evolution of Physical Intelligence Across Scales

open access: yesAdvanced Intelligent Discovery, EarlyView.
By following the evolution of physical intelligence across scales, this article shows how intelligence arises from materials, structures, physical interactions, and collectives. It establishes physical intelligence as the evolutionary foundation upon which embodied intelligence is built.
Ke Liu   +7 more
wiley   +1 more source

Hamiltonian paths in Cayley graphs

open access: yesDiscrete Mathematics, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pak, Igor, Radoičić, Radoš
openaire   +2 more sources

Comparison of DeePMD, MTP, GAP, ACE and MACE Machine‐Learned Potentials for Radiation‐Damage Simulations: A User Perspective

open access: yesAdvanced Intelligent Discovery, EarlyView.
The authors evaluated six machine‐learned interatomic potentials for simulating threshold displacement energies and tritium diffusion in LiAlO2 essential for tritium production. Trained on the same density functional theory data and benchmarked against traditional models for accuracy, stability, displacement energies, and cost, Moment Tensor Potential ...
Ankit Roy   +8 more
wiley   +1 more source

Arc-Disjoint Hamiltonian Cycles in Round Decomposable Locally Semicomplete Digraphs

open access: yesDiscussiones 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

Home - About - Disclaimer - Privacy