Results 91 to 100 of about 408 (250)
Divergent Synthesis of Möbius and Hückel N‐Heterocycloarenes From a Common Macrocyclic Backbone
Angewandte Chemie, EarlyView.In the divergent synthesis of Möbius and Hückel N‐heterocycloarenes from a common macrocyclic precursor, the annulation reaction dictates topology: Scholl reaction gives Möbius topology, while InCl3‐mediated alkyne annulation gives Hückel topology. The Möbius N‐heterocycloarene is unevenly contorted as revealed by crystal structure, and the Hückel N ...
Han Chen +6 more
wiley +2 more sources
Halide Perovskite: A Rich Source of Thermal Insulator
Advanced Science, EarlyView.Halide perovskites exhibit ultralow thermal conductivity driven by intrinsic lattice softness and strong anharmonicity, falling below conventional defect‐engineering limits. Weak metavalent bonding, A‐site rattling, and dynamic octahedral tilting drive phonon scattering to the Ioffe–Regel limit, where wave‐like tunneling replaces particle‐like ...
Haolin Ye +3 more
wiley +1 more source
Chemoenzymatic Synthesis of Well‐Defined α(2,8)‐ and α(2,9)‐Linked Oligosialosides
Angewandte Chemie, EarlyView.Well‐defined α(2,8)‐ and α(2,9)‐linked oligosialic acids of different lengths can be prepared by employing recombinant bacterial polysialyltransferases in combination with chemically modified CMP‐Neu5Ac derivatives. After transfer, a sialoside is formed bearing an artificial entity, which blocks further glycosylation.
Jelle A. Fok +4 more
wiley +2 more sources
Graceful labeling of triangular extension of complete bipartite graph
Electronic Journal of Graph Theory and Applications, 2019 For positive integers m, n, Km, n represents the complete bipartite graph. We name the graph G = Km, n ⊙ K2 as triangular extension of complete bipartite graph Km, n, since there is a triangle hanging from every vertex of Km, n.
Sarbari Mitra, Soumya Bhoumik
doaj +1 more source
Graceful Labeling For bipartite graceful Graphs and related Graphs
, 2020 The concept of graceful labels was proposed by Rosa, scholars began to study graceful labels of various graphs and obtained relevant results.Let the graph is a bipartite graceful graph, we have proved some graphs are graceful labeling in this paper.
Liu, Chunfeng +2 more
openaire +2 more sources
Advanced Science, EarlyView.Chronic microinflammation in high myopia suppresses MANF in lens epithelial cells. MANF normally resides within MAMs and promotes ubiquitin‐mediated degradation of the ER Ca2+ pump SERCA2. MANF loss causes pathological SERCA2 accumulation, MAM hyperassembly, and disrupted ER‐to‐mitochondria Ca2+ transfer, leading to mitochondrial failure, oxidative ...
Xin Liu +8 more
wiley +1 more source
On the Role of Preprocessing and Memristor Dynamics in Reservoir Computing for Image Classification
Advanced Electronic Materials, EarlyView.ABSTRACT Reservoir computing (RC) is an emerging recurrent neural network architecture that has attracted growing attention for its low training cost and modest hardware requirements. Memristor‐based circuits are particularly promising for RC, as their intrinsic dynamics can reduce network size and parameter overhead in tasks such as time‐series ...
Rishona Daniels +4 more
wiley +1 more source
Attractive Ni…O Interactions Enable Non‐Alternating Ethylene‐Carbon Monoxide Copolymerization
Angewandte Chemie, EarlyView.Attractive Ni···O interactions are established in phosphine‐imidated and phosphine‐phenolate nickel catalysts, enabling non‐alternating ethylene‐carbon monoxide copolymerization, resulting in superior CO tolerance, productivity and stability compared to the state‐of‐the‐art benchmark.
Yajun Zhao +5 more
wiley +2 more sources
On the Number of α-Labeled Graphs
Discussiones Mathematicae Graph Theory, 2018 When a graceful labeling of a bipartite graph places the smaller labels in one of the stable sets of the graph, it becomes an α-labeling. This is the most restrictive type of difference-vertex labeling and it is located at the very core of this research ...
Barrientos Christian, Minion Sarah
doaj +1 more source
Lucas Graceful Labeling For Some Graphs
, 2011 By a graph, we mean a finite undirected graph without loops or multiple edges.
Perumal, M. A. +2 more
openaire +3 more sources