Results 81 to 90 of about 3,844 (297)

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

Convex p-partitions of bipartite graphs [PDF]

open access: yes, 2016
Artículo de publicación ISIA set of vertices X of a graph G is convex if no shortest path between two vertices in X contains a vertex outside X. We prove that for fixed p >= 1, all partitions of the vertex set of a bipartite graph into p convex sets can ...
Safe, Martín D.   +3 more
core   +2 more sources

Conditional resolvability in graphs: a survey

open access: yesInternational Journal of Mathematics and Mathematical Sciences, 2004
For an ordered set W={w1,w2,…,wk} of vertices and a vertex v in a connected graph G, the code of v with respect to W is the k-vector cW(v)=(d(v,w1),d(v,w2),…,d(v,wk)), where d(x,y) represents the distance between the vertices x and y.
Varaporn Saenpholphat, Ping Zhang
doaj   +1 more source

Multimodal Correlation Feature Processing Method Based on Hypergraph [PDF]

open access: yesJisuanji gongcheng, 2017
Features are usually considered as independent of each other in traditional pattern recognition methods.The neglect of the correlation among multimodal features is part of the reason for recognition error.Aiming at integrating multimodal features,this ...
LUO Yong’en,HU Jicheng,XU Qian
doaj   +1 more source

Approximation algorithms for the partition vertex cover problem

open access: yesTheoretical Computer Science, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Suman Kalyan Bera   +3 more
openaire   +2 more sources

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

A new perspective on vertex connectivity [PDF]

open access: yes, 2013
Edge connectivity and vertex connectivity are two fundamental concepts in graph theory. Although by now there is a good understanding of the structure of graphs based on their edge connectivity, our knowledge in the case of vertex connectivity is much ...
Kuhn, Fabian   +5 more
core   +1 more source

Gluing affine Yangians with bi-fundamentals

open access: yesJournal of High Energy Physics, 2020
The affine Yangian of gl 1 $$ {\mathfrak{gl}}_1 $$ is isomorphic to the universal enveloping algebra of W 1 + ∞ $$ {\mathcal{W}}_{1+\infty } $$ and can serve as a building block in the construction of new vertex operator algebras. In [1], a two-parameter
Wei Li
doaj   +1 more source

Hydrogel‐Based Airway‐on‐Tube With Perfusable Endothelial Lumen and Outward Epithelialization

open access: yesAdvanced Materials, EarlyView.
A hydrogel‐based airway‐on‐tube platform featuring a perfusable endothelial lumen and outward epithelialization is presented. The system supports primary human bronchial epithelial and lung microvascular endothelial coculture under air‐liquid interface conditions.
Ali Doryab   +8 more
wiley   +1 more source

Component order edge connectivity, vertex degrees, and integer partitions

open access: yes, 2023
Given a finite, simple graph $G$, the $k$-component order edge connectivity of $G$ is the minimum number of edges whose removal results in a subgraph for which every component has order at most $k-1$.
Yatauro, Michael
core  

Home - About - Disclaimer - Privacy