Results 91 to 100 of about 43,946 (309)

Spin‐Split Edge States in Metal‐Supported Graphene Nanoislands Obtained by CVD

open access: yesAdvanced Materials, EarlyView.
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

Minimum Spanning Trees and Types of Dissimilarities

open access: yesEuropean Journal of Combinatorics, 1996
The author surveys and brings together a set of observations concerning dissimilarities, i.e., functions \(d\): \(X^2 \to [0, \infty)\) such that \(d(x,x) = 0\) and such that \(d(x,y) = d(y,x)\), and dissimilarity preorders \(R\) (reflexive and transitive relations) on \(X^2\), \(X\) a finite set, with the emphasis on compatibility relationships which ...
openaire   +1 more source

Atomistic Mechanisms Triggered by Joule Heating Effects in Metallic Cu‐Bi Nanowires for Spintronics

open access: yesAdvanced Materials, EarlyView.
Bi doped metallic Cu nanowires are promising for spintronics thanks to the stabilization of a giant spin Hall effect. However, heat resulting from current injection forces Bi to leave solution, forcing segregation into monoatomic decorations which evolve into coherent crystalline aggregates.
Alejandra Guedeja‐Marrón   +6 more
wiley   +1 more source

Spanning Trees Minimizing Branching Costs [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science
The Minimum Branch Vertices Spanning Tree problem aims to find a spanning tree $T$ in a given graph $G$ with the fewest branch vertices, defined as vertices with a degree three or more in $T$.
Luisa Gargano, Adele A. Rescigno
doaj   +1 more source

Polymorph‐Specific Electronic Transduction in WO3 during Molecular Sensing

open access: yesAdvanced Materials, EarlyView.
Metal‐oxide polymorphs with similar surface chemistry can nevertheless exhibit distinct sensing properties. In γ‐ and ε‐WO3, analyte adsorption appears comparable; yet, only ε‐WO3 induces a pronounced lattice electronic perturbation that accommodates charge in sub‐conduction band minimum states.
Matteo D'Andria   +6 more
wiley   +1 more source

Minimum Cost Arborescences [PDF]

open access: yes
In this paper, we analyze the cost allocation problem when a group of agents or nodes have to be connected to a source, and where the cost matrix describing the cost of connecting each pair of agents is not necessarily symmetric, thus extending the well ...
Dutta, Bhaskar, Mishra, Debasis
core   +2 more sources

PENERAPAN TEORI GRAF UNTUK MENYELESAIKAN MASALAH MINIMUM SPANNING TREE (MST) MENGGUNAKAN ALGORITMA KRUSKAL

open access: yesAksioma: Jurnal Program Studi Pendidikan Matematika, 2012
One of useful graph theory to solve the real problems is Minimum Spanning Tree (MST). MST is network optimization problems that can be applied in many fields such as transportations problems and communication network design (Gruber and Raidl, 2005).
Swaditya Rizki
doaj   +1 more source

Large‐Area 2D Metasurface‐Based Triboelectric E‐Skin Arrays: Contact & Proximity Tactile Mapping with Broadband Acoustic Readouts

open access: yesAdvanced Materials, EarlyView.
Metasurface‐engineered NC‐TENG arrays integrate tactile pressure mapping, non‐contact gesture sensing, and acoustic signal readouts in one ultrathin module, and outperforms pristine PDMS in terms of electrical output and real‐time spatial mapping for next‐gen wearables.
Injamamul Arief   +12 more
wiley   +1 more source

Solving Medium to Large Sized Euclidean Generalized Minimum Spanning Tree Problems [PDF]

open access: yes
The generalized minimum spanning tree problem is a generalization of the minimum spanning tree problem. This network design problems finds several practical applications, especially when one considers the design of a large-capacity backbone network ...
Ghosh, Diptesh
core  

Aplikasi Algoritma Semut Dalam Menentukan Pohon Merentang Minimum (Minimum Spanning Tree) Terhadap Lintasan yang Mengarah ke Pusat Perbelanjaan di Kota Palopo

open access: yesInfinity Jurnal Matematika dan Aplikasinya, 2020
Penelitian ini bertujuan untuk menentukan pohon merentang minimum (Minimum Spanning Tree) terhadap lintasan yang mengarah ke Pusat Perbelanjaan di Kota Palopo menggunakan Algoritma Semut.
Fatimah Fatimah, Marwan Sam
doaj  

Home - About - Disclaimer - Privacy