Results 81 to 90 of about 21,321 (296)
Spin‐Split Edge States in Metal‐Supported Graphene Nanoislands Obtained by CVD
Advanced 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
Sparse Vertex Cutsets and the Maximum Degree
The Electronic Journal of CombinatoricsWe show that every graph $G$ of maximum degree $\Delta$ and sufficiently large order has a vertex cutset $S$ of order at most $\Delta$ that induces a subgraph $G[S]$ of maximum degree at most $\Delta-3$. For $\Delta\in \{ 4,5\}$, we refine this result by considering also the average degree of $G[S]$.
Stéphane Bessy +3 more
openaire +3 more sources
A Simple NOVCA: Near Optimal Vertex Cover Algorithm [PDF]
, 2012 This paper describes an extremely fast polynomial time algorithm, the Near Optimal Vertex Cover Algorithm (NOVCA) that produces an optimal or near optimal vertex cover for any known undirected graph G (V, E).
Gajurel, Sanjaya, Bielefeld, Roger
core +1 more source
Polymorph‐Specific Electronic Transduction in WO3 during Molecular Sensing
Advanced 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
On the complexity of making a distinguished vertex minimum or maximum degree by vertex deletion
Journal of Discrete Algorithms, 2015 16 pages, 4 figures, submitted to Elsevier's Journal of Discrete ...
Sounaka Mishra +2 more
openaire +2 more sources
Distributed vertex cover algorithms for wireless sensor networks [PDF]
, 2014 Vertex covering has important applications for wireless sensor networks such as monitoring link failures,facility location, clustering, and data aggregation.
Kavalcı, Vedat +2 more
core +1 more source
Reformulated First Zagreb Index of Some Graph Operations
Mathematics, 2015 The reformulated Zagreb indices of a graph are obtained from the classical Zagreb indices by replacing vertex degrees with edge degrees, where the degree of an edge is taken as the sum of degrees of the end vertices of the edge minus 2. In this paper, we
Nilanjan De +2 more
doaj +1 more source
Discrete Dynamics in Nature and Society, 2021 The Wiener polarity index of a graph G, usually denoted by WpG, is defined as the number of unordered pairs of those vertices of G that are at distance 3. A vertex of a tree with degree at least 3 is called a branching vertex.
Sadia Noureen +2 more
doaj +1 more source
Advanced Materials, EarlyView.Co1/3TaS2${\rm Co}_{1/3}{\rm TaS}_{2}$ hosts a triple‐Q noncoplanar antiferromagnetic state with coexisting Z3${\rm Z}_3$ electronic nematicity. We report rotational hysteresis observed in both magnetoresistance and magnetic torque, revealing strongly pinned in‐plane weak ferromagnetic moments in the triple‐Q phase and the magnetism‐driven nature of ...
Joonyoung Choi +5 more
wiley +1 more source
On Bounded-Degree Vertex Deletion parameterized by treewidth
Discrete Applied Mathematics, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nadja Betzler +3 more
openaire +1 more source