Results 81 to 90 of about 154,862 (311)

Spatial Coordination Structure‐Driven Enzyme‐Like Selectivity in Single‐Atom Nanozymes

open access: yesAdvanced Materials, EarlyView.
Sun et al. reviews recent progress in enhancing the enzyme‐like catalytic selectivity of SAzymes through the rational design of their spatial coordination structures. They emphasize the structure‐activity relationships of various attributes of these coordination structures in promoting selective catalytic behavior, the strategic design of coordination ...
Qijun Sun   +6 more
wiley   +1 more source

On the Edge-Hyper-Hamiltonian Laceability of Balanced Hypercubes

open access: yesDiscussiones Mathematicae Graph Theory, 2016
The balanced hypercube BHn, defined by Wu and Huang, is a variant of the hypercube network Qn, and has been proved to have better properties than Qn with the same number of links and processors.
Cao Jianxiang, Shi Minyong, Feng Lihua
doaj   +1 more source

Chromatic Roots and Hamiltonian Paths

open access: yesJournal of Combinatorial Theory, Series B, 2000
AbstractWe present a new connection between colorings and hamiltonian paths: If the chromatic polynomial of a graph has a noninteger root less than or equal to t0=23+1326 +633+1326 +633=1.29559…,then the graph has no hamiltonian path. This result is best possible in the sense that it becomes false if t0 is replaced by any larger number.
openaire   +2 more sources

Preparing Magnon–Photon Pairs in a Cavity–Magnon–Qubit System

open access: yesAdvanced Photonics Research, EarlyView.
By utilizing the photon blockade effect, hybrid magnon–photon quantum states are prepared in a cavity–magnon–qubit system. Through the analysis of correlation functions, the generated magnon–photon pairs are shown to exhibit high purity and strong correlations.
Yi Ren   +3 more
wiley   +1 more source

Hamiltonian paths on 3-polytopes

open access: yesJournal of Combinatorial Theory, Series B, 1972
AbstractThe smallest number of vertices, edges, or faces of any 3-polytope with no Hamiltonian path is determined. Similar results are found for simplicial polytopes with no Hamiltonian path.
openaire   +2 more sources

Topological Berry Antenna on a Silicon Chip for Terahertz Wireless Communication

open access: yesAdvanced Photonics Research, EarlyView.
The on‐chip topological Berry antenna for 6G to Xth‐generation wireless communication is designed via integrating various Berry curvatures for an enhanced antenna aperture and radiation gain. This THz antenna has demonstrated a maximum gain of 17 dBi and chip‐to‐chip wireless communications at 20 Gbps over a distance of 15 cm.
Sonu Kumar   +8 more
wiley   +1 more source

Antidirected Hamiltonian paths in tournaments

open access: yesJournal of Combinatorial Theory, Series B, 1972
AbstractIn this paper we present a short proof of Grünbaum's theorem concerning the existence of antidirected Hamiltonian (ADH) paths in tournaments. We also prove that, in every tournament Tn with n ≥ 12, there is an ADH path starting at any vertex.
openaire   +2 more sources

Role of the Setae in an Ectoparasitic Seal Louse in Reducing Surface Drag: Numerical Modeling Approach

open access: yesAdvanced Theory and Simulations, EarlyView.
The seal louse Echinophthirius horridus has uniquely shaped setae that may reduce drag during its host's dives. Using numerical simulations, this study demonstrates that their natural inclination promotes vortex formation, minimizing friction and energy loss. These findings provide insights into biological surface adaptations and may inspire the design
Anika Preuss   +3 more
wiley   +1 more source

A new local path planning approach based on improved dual covariant Hamiltonian optimization for motion planning method

open access: yesAdvances in Mechanical Engineering, 2019
We propose a new local path planning approach based on optimization methods with probabilistic completeness in this article. This approach adds a linear constraint to the original covariant Hamiltonian optimization for motion planning problem with a new ...
Bo You   +4 more
doaj   +1 more source

Graphs with Many Hamiltonian Paths

open access: yes, 2021
A graph is \emph{hamiltonian-connected} if every pair of vertices can be connected by a hamiltonian path, and it is \emph{hamiltonian} if it contains a hamiltonian cycle. We construct families of non-hamiltonian graphs for which the ratio of pairs of vertices connected by hamiltonian paths to all pairs of vertices approaches 1. We then consider minimal
Carlson, Erik   +5 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy