Results 71 to 80 of about 21,234 (294)
Vertex Degree Weighted Path Indices
Acta Chimica Slovenica, 2016 Vertex degree weighted path indices P(N)(a, b, ...), for example P(1)(a, b), P(2)(a, b, c), P(3)(a, b, c, d), and P(4)(a, b, c, d, e), are good topological indices for some of the physicochemical properties of octanes with |R|(max) up to 0.999. Mutually optimized combinations of them are even better, R (P(1)..P(4)) is in the worst tested case > 0.9 ...
openaire +5 more sources
Advanced Healthcare Materials, EarlyView.This review examines how in vitro electrical and mechanical stimulation modulates wound healing in fibroblasts and keratinocytes. Analyzing over 560 experimental data points, we relate stimulation parameters to proliferation and migration outcomes, evaluate platform designs, and highlight the need for multi‐parameter optimization to advance targeted ...
Matthew K. Burgess +3 more
wiley +1 more source
Limit distributions of the number of vertices with given degree in a conditional configuration graph
Transactions of the Karelian Research Centre of the Russian Academy of Sciences, 2016 We consider configuration graphs with N vertices. The degrees of the vertices are independent identically distributed random variables according to power-law distribution. Node degrees form semiedges that are numbered in an arbitrary order.
Yury Pavlov
doaj +1 more source
Long‐Term Hydrophilic, Anti‐Clotting, and Anti‐Fibrotic Dynamic Covalent Silicone‐Based Biomaterials
Advanced Healthcare Materials, EarlyView.Dynamic covalent crosslinking of a Schiff‐base silicone elastomer with hydrazide‐functionalized polymers is demonstrated to improve the long‐term hydrophilicity as well as the anti‐fouling and anti‐clotting properties of PDMS implants. The hydrazone‐functionalized material prevents hydrophobic recovery, resists clotting, and significantly reduces ...
Norma A. Garza Flores +12 more
wiley +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
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
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
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
Total vertex product irregularity strength of graphs
, 2023 Consider a simple graph $G$. We call a labeling $w:E(G)\cup V(G)\rightarrow \{1, 2, \ldots, s\}$ (total vertex) product-irregular, if all product degrees $pd_G(v)$ induced by this labeling are distinct, where \( pd_G(v)=w(v)×\prod_{e\in v}w(e) \).
Marcin Anholcer +5 more
core +1 more source