Results 101 to 110 of about 3,095,070 (339)
Cycle spectra of Hamiltonian graphs
AbstractWe prove that every Hamiltonian graph with n vertices and m edges has cycles with more than p−12lnp−1 different lengths, where p=m−n. For general m and n, there exist such graphs having at most 2⌈p+1⌉ different cycle lengths.
Kevin G. Milans+4 more
openaire +2 more sources
Spatial Coordination Structure‐Driven Enzyme‐Like Selectivity in Single‐Atom Nanozymes
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
Multicolored parallelisms of Hamiltonian cycles
AbstractA subgraph in an edge-colored graph is multicolored if all its edges receive distinct colors. In this paper, we prove that a complete graph on 2m+1 vertices K2m+1 can be properly edge-colored with 2m+1 colors in such a way that the edges of K2m+1 can be partitioned into m multicolored Hamiltonian cycles.
Hung-Lin Fu, Yuan-Hsun Lo
openaire +2 more sources
Protected Chaos in a Topological Lattice
Topological and chaotic dynamics are often considered incompatible, with one expected to dominate or disrupt the other. This work reveals that topological localization can persist even under strong chaotic dynamics and, counter‐intuitively, protect chaotic behavior.
Haydar Sahin+6 more
wiley +1 more source
Proton Acceleration with Relativistic Electromagnetic Shock
New Ion Acceleration Mechanism! A novel cosmic‐ray proton acceleration mechanism is proposed, where relativistic electromagnetic shocks accelerate protons transversely. Hamiltonian analysis yields a scaling law linking the proton energy to the minimum longitudinal thickness of the shock.
Ting Xiao+5 more
wiley +1 more source
On the cycle structure of hamiltonian k-regular bipartite graphs of order 4k [PDF]
It is shown that a hamiltonian $n/2$-regular bipartite graph $G$ of order $2n>8$ contains a cycle of length $2n-2$. Moreover, if such a cycle can be chosen to omit a pair of adjacent vertices, then $G$ is bipancyclic.Comment: 3 ...
Adamus, Janusz
core
Hamiltonian Cycles in the Square of a Graph [PDF]
We show that under certain conditions the square of the graph obtained by identifying a vertex in two graphs with hamiltonian square is also hamiltonian. Using this result, we prove necessary and sufficient conditions for hamiltonicity of the square of a connected graph such that every vertex of degree at least three in a block graph corresponds to a
openaire +3 more sources
The use of air stable but thermally labile molecules provides an efficient strategy for the N‐type doping of organic semiconductors with relatively low electron affinities. Design criteria for efficient dopants should also take into account diffusion and phase segregation that cannot be decoupled from thermally activated doping.
Francesca Pallini+15 more
wiley +1 more source
A Survey on Hamiltonian Cycles
In this article, we give a survey hamiltonian theorems, problems and conjectures in graph theorical aspect which supplements a well-known survey of Gould.
openaire +3 more sources
A Ru8%‐Co3O4 catalyst containing Ru single atoms (SAs) exhibits exceptional oxygen evolution reaction (OER) and hydrogen evolution reaction (HER) performance in acidic, neutral, and alkaline media. When used as the anode and cathode catalysts in an anion exchange membrane water electrolyzer (AEMWE) device, a low cell voltage of just 2.06 V is needed to
Yongfang Zhou+9 more
wiley +1 more source