Results 211 to 220 of about 782,126 (230)

Water‐Activated Phospholipid Phase‐Separation Gel as an Immunomodulatory Anti‐Adhesion Barrier for Postoperative Adhesion Prevention

Advanced Healthcare Materials, EarlyView.
A water‐activated phospholipid phase‐separation gel is repurposed as a drug‐free surgical barrier for postoperative adhesion prevention. Propylene glycol promotes rapid lamellar gel reinforcement, prolonged local retention, and tissue coverage, while phosphatidylcholine‐mediated immunomodulation suppresses inflammatory and fibrotic responses. This dual‐
Jong‐Ju Lee, Yulseung Sung, Yeji Kim, Heesang Yang, Suyeon Pyo, Byeol Yun, Sung‐Joo Hwang   +6 more
wiley   +1 more source

Bioinspired Adaptive Sensors: A Review on Current Developments in Theory and Application

Advanced Materials, EarlyView.
This review comprehensively summarizes the recent progress in the design and fabrication of sensory‐adaptation‐inspired devices and highlights their valuable applications in electronic skin, wearable electronics, and machine vision. The existing challenges and future directions are addressed in aspects such as device performance optimization ...
Guodong Gong, You Zhou, Qingxiu Li, Wenyu Zhao, Sunyingyue Geng, Hangfei Li, Yan‐Bing Leng, Shirui Zhu, Guanglong Ding, Yongbiao Zhai, Ziyu Lv, Ye Zhou, Su‐Ting Han   +12 more
wiley   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Vertex‐transitive graphs: Symmetric graphs of prime valency

Journal of Graph Theory, 1984
AbstractLet G be a group acting symmetrically on a graph Σ, let G1 be a subgroup of G minimal among those that act symmetrically on Σ, and let G2 be a subgroup of G1 maximal among those normal subgroups of G1 which contain no member except 1 which fixes a vertex of Σ. The most precise result of this paper is that if Σ has prime valency p, then either Σ
openaire   +2 more sources

Prime Testing for the Split Decomposition of a Graph

SIAM Journal on Discrete Mathematics, 1989
Summary: An \(O(n^ 2)\) algorithm for testing whether a graph is decomposable with respect to the split decomposition is developed. The fastest previous algorithm required \(\Omega (n^ 3)\) time for this problem. This leads to an \(O(n^ 2)\) expected time algorithm for computing the split decomposition of a graph.
openaire   +3 more sources

The N-Prime Graph Question is equivalent to the Prime Graph Question

Let $G$ be a finite group and let $V(\mathbb ZG)$ be the group of normalized units of its integral group ring. We prove that every $N$-prime arc of $V(\mathbb ZG)$ either already occurs in $G$ or admits commuting witnesses of distinct prime orders. Writing $A(Δ)$ for the arc set of a directed graph $Δ$, $E(Δ)$ for the edge set of an undirected graph ...
openaire   +1 more source

Prime Graphs of Some Graphs

Journal of Advanced Research in Dynamical and Control Systems, 2020
Simaringa M, Santhoshkumar K
openaire   +1 more source

The prime graphs of groups with arithmetically small composition factors

Annali Di Matematica Pura Ed Applicata, 2023
Thomas Michael Keller
exaly  

Coherent network partitions: Characterizations with cographs and prime graphs

Theoretical Computer Science, 2021
Zoran Nikoloski, Sara Omranian
exaly  

Prime Distance Graphs and Applications of Graph Labeling: A Modelling Approach

2022
A Parthiban
exaly  

Computation of Narayana Prime Cordial Labeling of Book Graphs

Trends in Mathematics, 2019
K Thirusangu, B J Balamurugan
exaly