Illustration of the synthetic route and mechanism of HEAs with dual‐confinement strategy. This study developed a symbiotic dual‐confinement strategy integrating interstitial oxygen doping and carbon coating to enhance high‐entropy alloys for high‐current‐density zinc‐air batteries.
Xiaoxiao Zou+6 more
wiley +1 more source
Partial monotonizations of Hamiltonian cycle polytopes: dimensions and diameters [PDF]
Gerard Sierksma, Ruud Teunter
openalex +1 more source
Effects of Concurrent Sulfur and Phosphorus Incorporation in Nickel Cyclam‐Based Complexes
The concurrent incorporation of phosphorus and sulfur into cyclam is investigated by the synthesis of the P, S, N‐containing 14‐membered macrocycles and their corresponding nickel complexes, which exist in both square‐planar and octahedral geometries.
Tatiana Guseva+6 more
wiley +1 more source
Number of Subgraphs and Their Converses in Tournaments and New Digraph Polynomials
ABSTRACT An oriented graph D $D$ is converse invariant if, for any tournament T $T$, the number of copies of D $D$ in T $T$ is equal to that of its converse −D $-D$. El Sahili and Ghazo Hanna [J. Graph Theory 102 (2023), 684‐701] showed that any oriented graph D $D$ with maximum degree at most 2 is converse invariant.
Jiangdong Ai+4 more
wiley +1 more source
Spanning Plane Subgraphs of 1‐Plane Graphs
ABSTRACT A graph drawn on the plane is called 1‐plane if each edge is crossed at most once by another edge. In this paper, we show that every 4‐edge‐connected 1‐plane graph has a connected spanning plane subgraph. We also show that there exist infinitely many 4‐connected 1‐plane graphs that have no 2‐connected spanning plane subgraphs.
Kenta Noguchi+2 more
wiley +1 more source
Fault-free Hamiltonian cycles in faulty butterfly graphs [PDF]
Shien‐Ching Hwang, Gen-Huey Chen
openalex +1 more source
Recognizing Trees From Incomplete Decks
ABSTRACT Given a graph G $G$, the unlabeled subgraphs G − v $G-v$ are called the cards of G $G$. The deck of G $G$ is the multiset { G − v : v ∈ V ( G ) } $\{G-v:v\in V(G)\}$. Wendy Myrvold showed that a disconnected graph and a connected graph both on n $n$ vertices have at most ⌊ n 2 ⌋ + 1 $\lfloor \frac{n}{2}\rfloor +1$ cards in common and found ...
Gabriëlle Zwaneveld
wiley +1 more source
The number of Hamiltonian paths and cycles on k-colored graphs
David A. Klarner
openalex +1 more source
Exploring Time‐Domain Femtosecond Rotational Coherent Raman Scattering for Diagnostics
The diagnostic potential of femtosecond (fs) rotational coherent Raman scattering (RCRS) in the time domain is initially investigated. Experiments in air and pure nitrogen are reported, revealing the temperature sensitivity in the recorded fs‐RCRS temporal scans.
Meena Raveesh+9 more
wiley +1 more source
Free Energies of Reaction for Aqueous Glycine Condensation Chemistry at Extreme Temperatures
This book is Open Access. A digital copy can be downloaded for free from Wiley Online Library.
Explores the behavior of carbon in minerals, melts, and fluids under extreme conditions
Carbon trapped in diamonds and carbonate-bearing rocks in subduction zones are examples of the continuing exchange of substantial carbon ...
Matthew Kroonblawd, Nir Goldman
wiley +1 more source