Results 71 to 80 of about 76,992 (320)
Research on phase ratio‐dependent modulation of built‐in electric fields and d‐band centers in yolk–shell structured C@MoS2‐MoSe2 has determined that the C@3MoS2‐1MoSe2 configuration is optimal, which can achieve an optimal d‐band center position and enhance electrochemical performance.
Ruixian Duan +11 more
wiley +1 more source
On Hamiltonian Cycles in Claw-Free Cubic Graphs
We show that every claw-free cubic graph of order n at least 8 has at most 2⌊n4⌋{2^{\left\lfloor {{n \over 4}} \right\rfloor }} Hamiltonian cycles, and we also characterize all extremal graphs.
Mohr Elena, Rautenbach Dieter
doaj +1 more source
Thoughts on Barnette's Conjecture [PDF]
We prove a new sufficient condition for a cubic 3-connected planar graph to be Hamiltonian. This condition is most easily described as a property of the dual graph. Let $G$ be a planar triangulation.
Alt, Helmut +3 more
core
A microfluidic system enables the rapid, room‐temperature fabrication of channel‐rich Pd‐Cu alloy nanodendrites with tunable composition, uniform morphology, and finely branched internal structures. The resulting catalysts exhibit over 90% formate selectivity across a broad potential window, along with excellent CO tolerance and enhanced long‐term ...
Xintong Huang +7 more
wiley +1 more source
MEDIA PEMBELAJARAN PENCARIAN EULERIAN CIRCUIT DAN HAMILTONIAN CYCLE PADA GRAF SEDERHANA [PDF]
Penelitian ini membahas tentang perancangan media pembelajaran pencarian Eulerian circuit dan Hamiltonian cycle pada graf sederhana. Perancangan media pembelajaran ini terdiri dari perancangan skenario media pembelajaran, perancangan user interface ...
Reza Wafdan
core
In this paper, the first use of a siloxane‐substituted silicon phthalocyanine (iso(Si3O)2SiPc) in OTFTs is reported. Moreover, this compound displays the highest hole mobility (exceeding 1 cm2 V−1 s−1) ever recorded for SiPc, and the GIWAXS study reveals thin films with an exceptionally uniform crystalline texture.
Nicolas Ledos +5 more
wiley +1 more source
Hamiltonian cycle clustering with asymmetric correlation
Analysts who explore high-dimensional data usually want three answers at once: Which samples belong together, how close the resulting groups are, and who influences whom accordingly.
Tianyi Huang +2 more
doaj +1 more source
On the Hamiltonian Number of a Plane Graph
The Hamiltonian number of a connected graph is the minimum of the lengths of the closed spanning walks in the graph. In 1968, Grinberg published a necessary condition for the existence of a Hamiltonian cycle in a plane graph, formulated in terms of the ...
Lewis Thomas M.
doaj +1 more source
Polynomial algorithms that prove an NP-hard hypothesis implies an NP-hard conclusion [PDF]
A number of results in Hamiltonian graph theory are of the form $\mathcal{P}$$_{1}$ implies $\mathcal{P}$$_{2}$, where $\mathcal{P}$$_{1}$ is a property of graphs that is NP-hard and $\mathcal{P}$$_{2}$ is a cycle structure property of graphs that is ...
Bauer, D. +3 more
core +2 more sources
Polymer‐based drug delivery systems can effectively overcome the limitations of free drugs in terms of solubility, stability, and plasma half‐life, yet their development has traditionally relied on time‐consuming trial‐and‐error approaches. This review highlights recent advances in applying molecular simulation to the design of polymer‐based drug ...
Ping Gao +4 more
wiley +1 more source

