Results 121 to 130 of about 78,303 (310)
Limit cycles of discontinuous piecewise linear differential systems formed by centers or Hamiltonian without equilibria separated by irreducible cubics [PDF]
Loubna Damene, Rebiha Benterki
openalex +1 more source
In this work, we developed a phase‐stability predictor by combining machine learning and ab initio thermodynamics approaches, and identified the key factors determining the favorable phase for a given composition. Specifically, a lower TM ionic potential, higher Na content, and higher mixing entropy favor the O3 phase.
Liang‐Ting Wu +6 more
wiley +1 more source
Energy Conditions for Hamiltonicity of Graphs
Let G be an undirected simple graph of order n. Let A(G) be the adjacency matrix of G, and let μ1(G)≤μ2(G)≤⋯≤μn(G) be its eigenvalues. The energy of G is defined as ℰ(G)=∑i=1n|μi(G)|. Denote by GBPT a bipartite graph.
Guidong Yu +3 more
doaj +1 more source
Disjoint hamiltonian cycles in bipartite graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ferrara, Michael +3 more
openaire +2 more sources
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
X‐ray magnetic circular dichroism
International Tables for Crystallography is the definitive resource and reference work for crystallography and structural science.
Each of the eight volumes in the series contains articles and tables of data relevant to crystallographic research and to applications of crystallographic methods in all sciences concerned with the ...
Gerrit van der Laan C. Chantler +2 more
wiley +1 more source
Enumeration of Hamiltonian Cycles in 6-cube [PDF]
Michel Deza, Roman Shklyar
openalex +1 more source
Hamiltonian cycles in subdivided doubles
The subdivided double construction on 4-regular graphs was used by Potočnik and Wilson to explore semi-symmetric (edge-transitive but not vertex-transitive) graphs, and can be used to construct every semi-symmetric 4-regular graph that contains a pair of twin vertices.
openaire +2 more sources
Designing Memristive Materials for Artificial Dynamic Intelligence
Key characteristics required of memristors for realizing next‐generation computing, along with modeling approaches employed to analyze their underlying mechanisms. These modeling techniques span from the atomic scale to the array scale and cover temporal scales ranging from picoseconds to microseconds. Hardware architectures inspired by neural networks
Youngmin Kim, Ho Won Jang
wiley +1 more source
On edge-graceful labeling and deficiency for regular graphs
An edge-graceful labeling of a finite simple graph with vertices and edges is a bijection from the set of edges to the set of integers such that the vertex sums are pairwise distinct modulo , where the vertex sum at a vertex is the sum of labels of all ...
Tao-Ming Wang, Guang-Hui Zhang
doaj +1 more source

