Results 51 to 60 of about 11,128 (261)

CD4+ Tregs Drive Post‐Ischemic Sprouting Angiogenesis via Endothelial YY1/MAML1 Reactivation

Advanced Science, EarlyView.
ABSTRACT Microvascular complications of diabetes are chronic diseases of small vessels. We previously found that CD4+ regulatory T‐cells (Tregs) are markedly reduced in type 2 diabetes (T2D) after ischemic injury in both mice and humans, and that Treg deficiency in immunodeficient mice impairs vascular regeneration.
Hang Qu, Cheng Kiu Ho, Jitao Liu, Lei Cui, Yangfeng Hou, Cai Liang, Wenchu Ye, Randolph H. L. Wong, Shohei Hori, Bin Zhou, Kathy O. Lui   +10 more
wiley   +1 more source

Planar and non-planar wheel-related networks possess edge -graceful labeling

Mathematics Open
For an integer [Formula: see text], consider a collection of numbers [Formula: see text] and a network [Formula: see text] with [Formula: see text] and [Formula: see text].
Mohamed R. Zeen El Deen, I. Hanafy, S. Shehda, N. Omar   +3 more
doaj   +1 more source

Geometric Simultaneous Embeddings of a Graph and a Matching

Journal of Graph Algorithms and Applications, 2011
The geometric simultaneous embedding problem asks whether two planar graphs on the same set of vertices in the plane can be drawn using straight lines, such that each graph is plane.
Sergio Cabello, Marc van Kreveld, Giuseppe Liotta, Henk Meijer, Bettina Speckmann, Kevin Verbeek   +5 more
doaj   +1 more source

Stable Sets in {ISK4,wheel}-Free Graphs [PDF]

Algorithmica, 2017
An ISK4 in a graph G is an induced subgraph of G that is isomorphic to a subdivision of K4 (the complete graph on four vertices). A wheel is a graph that consists of a chordless cycle, together with a vertex that has at least three neighbors in the cycle. A graph is {ISK4,wheel}-free if it has no ISK4 and does not contain a wheel as an induced subgraph.
Milanič, Martin, Penev, Irena, Trotignon, Nicolas   +2 more
openaire   +3 more sources

Friend, Not Foe: Lowered Tissue Reactivity to Long‐Term Polyimide Implants

Advanced Science, EarlyView.
The choice of optimal neural probe designs remains a major challenge in the field of neurotechnology. This study investigated the biocompatibility of several probe variations, including material, thickness, width, and implantation strategy. It highlights the clear advantage of soft polyimide probes over stiff silicon probes for better device ...
Corinne Orlemann, Laura M. De Santis, Paul Neering, Christian Boehler, Kirti Sharma, Arno Aarts, Tobias Holzhammer, Rik J. J. van Daal, Patrick Ruther, Maria Asplund, Roxana N. Kooijmans, Pieter R. Roelfsema   +11 more
wiley   +1 more source

Complexity of Join and Corona graphs and Chebyshev polynomials

Journal of Taibah University for Science, 2018
Boesh and Prodinger have shown how to use properties of Chebyshev polynomials to compute formulas for the number of spanning trees of some special graphs.
S. N. Daoud
doaj   +1 more source

On dynamic colouring of cartesian product of complete graph with some graphs

Journal of Taibah University for Science, 2020
A proper vertex colouring is called a 2-dynamic colouring, if for every vertex v with degree at least 2, the neighbours of v receive at least two colours. The smallest integer k such that G has a dynamic colouring with k colours denoted by $\chi _2(G) $.
K. Kaliraj, H. Naresh Kumar, J. Vernold Vivin   +2 more
doaj   +1 more source

An Energy Autonomous Microneedle Array‐Based Sensing System for Continuous Biomarker Monitoring

Advanced Science, EarlyView.
This work presents an innovative self‐powered wearable biosensor system for real‐time monitoring of multiple biomarkers in interstitial fluid. The device integrates stainless steel‐based minimally invasive microneedles with ion‐selective membranes, enabling simultaneous Na+, K+, Ca2+, pH, and glucose detection.
Arnab Pal, Kai‐Po Fan, Sheng‐Chun Hung, Jaba Roy Chowdhury, Jun‐Hsun Chung, Meenakshi Ray, Hsiang‐Yun Hsu, Fu‐Cheng Kao, Kuei‐Lin Liu, Zong‐Hong Lin   +9 more
wiley   +1 more source

On wheel-free graphs

, 2013
A wheel is a graph formed by a chordless cycle and a vertex that has at least three neighbors in the cycle. We prove that every 3-connected graph that does not contain a wheel as a subgraph is in fact minimally 3-connected. We give a new proof of a theorem of Thomassen and Toft: every graph that does not contain a wheel as a subgraph is 3-colorable.
Aboulker, Pierre, Havet, Frédéric, Trotignon, Nicolas   +2 more
openaire   +2 more sources

RHINO: An Integrative Multi‐Omics Framework Linking Circadian Physiology to Precision Medicine

Advanced Science, EarlyView.
RHINO (RHythmic Interacting Network for multi‐Omics) is an integrative framework that maps circadian regulation across diverse genetic and disease contexts and prioritizes druggable circadian targets. Released as an AI‐powered interactive web portal, RHINO unifies genetic, regulatory, disease, and drug–target information, enabling context‐specific ...
Ying Chen, Chengxuan Chen, Dishu Zhou, Panpan Liu, Roberto E. López‐Valiente, Yuan Liu, Cam Mong La, Isabella Beraldo Xavier, Sean M. Hartig, Pradip Saha, Zheng Sun, Leng Han, Dongyin Guan   +12 more
wiley   +1 more source