Results 81 to 90 of about 63,549 (264)
Self‐Healing and Stretchable Synaptic Transistor
A self‐healing stretchable synaptic transistor (3S‐T) is realized using a p‐PVDF‐HFP‐DBP/PDMS‐MPU‐IU bilayer as gate insulator, where dipole‐dipole interaction enhances polarization to achieve a large memory window. Leveraging its neuronal biomimicry, the synaptic transistor demonstrates electrically compatibility with the biological brain. Furthermore,
Hyongsuk Choo +10 more
wiley +1 more source
The hull number of an oriented graph
We present characterizations of connected graphs G of order n≥2 for which h+(G)=n. It is shown that for every two integers n and m with 1≤n−1≤m≤(n2), there exists a connected graph G of order n and size m such that for each integer k with 2≤k≤n, there ...
Gary Chartrand +2 more
doaj +1 more source
On cyclically orientable graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
This paper presents a digital microfluidics‐based technique for transferring and reconfiguring soft nanomembranes. Laser‐machined nanothin membranes are picked up, transported, and aligned via tailored surface tension and the actuation of water droplets, enabling the development of flexible electronics, the integration of functional materials on 3D ...
Quang Anh Nguyen +15 more
wiley +1 more source
Maximal Orientations of Graphs
Orientations of connected graphs that maximize the spectral norm of the adjacency matrix are studied, and a conjecture of Hoppen, Monsalve and Trevisan is solved.
openaire +3 more sources
A Ni,Cd‐codoped Fe2VO4/NF bifunctional electrocatalyst is rationally designed for efficient seawater electrolysis. Synergistic effect modulates electron configuration, optimizes intermediates adsorption, stabilizes high‐valence Fe/V sites, and repels chloride ions to suppress corrosion and side reactions, thus contributing to performance improvement of
Weiguo Huang +15 more
wiley +1 more source
An orientation of a graph \(H\) is a digraph obtained from \(H\) by giving to each edge one of its two possible orientations. A digraph \(G\) is an oriented graph if it is an orientation of some graph \(H\). An oriented \(k\)-coloring of an oriented graph \(G\) is a partition of the vertex set of \(G\) into \(k\) color classes such that no two adjacent
openaire +2 more sources
On the Cocircuit Graph of an Oriented Matroid [PDF]
The authors consider the cocircuit graph \(G_{\mathcal M}\) of an oriented matroid \(\mathcal M\), the 1-skeleton of the cell complex \(\mathcal W\) formed by the span of the cocircuits of \(\mathcal M\). In general, \(\mathcal W\) is not determined by \(G_{\mathcal M}\). The main result of the paper is the proof that if the vertex set (resp. edge set)
Raul Cordovil +2 more
openaire +2 more sources
This work demonstrates a scalable, low‐temperature synthesis strategy that combines a thioacetamide (TA)‐based dual sulfur source with CdS chlorination, enabling the formation of high‐quality Sb2S3 with a reduced open‐circuit voltage loss, resulting in improved device efficiency.
Vijay C. Karade +16 more
wiley +1 more source
In this report, a self‐adaptive anhydrous passivation strategy is introduced by incorporating trimellitic anhydride (TMAH) into the perovskite precursor. In situ hydrolysis of TMAH yields trimellitic acid (TMA); ‐C═O/‐COO− groups of TMAH/TMA form a chelate with undercoordinated Pb2+/Sn2+, regulate nucleation, promote (100) orientation, passivate ...
Md. Ataur Rahman +6 more
wiley +1 more source

