Results 101 to 110 of about 520,977 (330)
Spin‐Split Edge States in Metal‐Supported Graphene Nanoislands Obtained by CVD
Combining STM measurements and ab‐initio calculations, we show that zig‐zag edges in graphene nanoislands grown on Ni(111) by CVD retrieve their spin‐polarized edge states after intercalation of a few monolayers of Au. ABSTRACT Spin‐split states localized on zigzag edges have been predicted for different free‐standing graphene nanostructures.
Michele Gastaldo +6 more
wiley +1 more source
Padmakar-Ivan Index of Some Types of Perfect Graphs
Manju Sankaramalil Chithrabhanu +1 more
openalex +1 more source
Multiphysics‐Driven Assembly of Biomimetic Vesicles
Artificial extracellular vesicles, derived from cell membranes, are manufactured using a multiphysics‐integrated microfluidic platform that combines nanoknife membrane rupture, herringbone chaotic mixing, and acoustothermal modulation. This standardizable workflow enables the predictable control of vesicle formation and therapeutic loading, while ...
Timofei Solodko +16 more
wiley +1 more source
Computing a Clique Tree with the Algorithm Maximal Label Search
The algorithm MLS (Maximal Label Search) is a graph search algorithm that generalizes the algorithms Maximum Cardinality Search (MCS), Lexicographic Breadth-First Search (LexBFS), Lexicographic Depth-First Search (LexDFS) and Maximal Neighborhood Search (
Anne Berry, Geneviève Simonet
doaj +1 more source
Using femtosecond ablation, we show that an ordered, stoichiometric crystalline PdSe2 target can be controllably converted into a stable, disordered, non‐stoichiometric, and highly functional amorphous nanomaterial, PdSe2−x${\rm PdSe}_{2-x}$. The obtained nanoparticles offer significant advantages over conventional planar plasmon‐free substrates due to
Andrei Ushkov +18 more
wiley +1 more source
Unique Perfect Phylogeny Characterizations via Uniquely Representable Chordal Graphs
The perfect phylogeny problem is a classic problem in computational biology, where we seek an unrooted phylogeny that is compatible with a set of qualitative characters.
Gysel, Rob
core
Recognizing Perfect 2-Split Graphs
A graph is said to be a split graph if its vertices can be partitioned into a clique and a stable set. A graph is a \(k\)-split graph if its vertices can be partitioned into \(k\) sets, each of which induces a split graph. It is proved that the strong perfect graph conjecture is true for 2-split graphs, and a polynomial algorithm for recognizing a ...
Hoàng, Chính T., Le, Van Bang
openaire +2 more sources
This critical review presents a comprehensive roadmap for the precision 3D printing of cellulose. Quantitative correlations link ink formulation and rheological properties to print fidelity and final material performance. This framework guides the development of advanced functional materials, from biomedical scaffolds to electromagnetic shielding ...
Majed Amini +3 more
wiley +1 more source
In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on the other, is extended to the setting of general planar directed (and undirected)
Kenyon, Richard W. +2 more
core +2 more sources

