Results 61 to 70 of about 946,691 (269)

A Degradable Bioinspired Flier with Aerogel‐Based Colorimetric Sensors for Environmental Monitoring

Advanced Science, EarlyView.
Biodegradable fliers are developed inspired by Tipuana tipu samaras, integrating cellulose nanocrystal aerogel (CNCa) sensors loaded with natural dyes for pH and ammonia detection. The lightweight, degradable fliers mimic natural morphology and aerodynamics, offering an eco‐friendly, scalable solution for in situ environmental monitoring after passive ...
Gianpaolo Gallo, Ruowen Tu, Carlo Filippeschi, Stefano Mariani, Barbara Mazzolai   +4 more
wiley   +1 more source

The regularity of binomial edge ideals of graphs [PDF]

, 2013
We prove two recent conjectures on some upper bounds for the Castelnuovo-Mumford regularity of the binomial edge ideals of some different classes of graphs.
Dariush Kiani, Saeedi Madani, Sara
core  

Hyperviscous Diabetic Bone Marrow Niche Impairs BMSCs Osteogenesis via TRPV2‐Mediated Cytoskeletal‐Nuclear Mechanotransduction

Advanced Science, EarlyView.
Diabetic bone marrow exhibits pathological ECM hyperviscosity that activates TRPV2‐mediated Ca2⁺ influx, leading to perinuclear F‐actin disassembly, nuclear deformation, and chromatin condensation. This cytoskeletal‐nuclear decoupling suppresses osteogenic differentiation of BMSCs.
Yao Wen, Xinhui Zheng, Jieliu Li, Minyu He, Dongqi Fan, Xingyu Zhu, Qiming Zhai, Liangjing Xin, Tao Chen   +8 more
wiley   +1 more source

Choice Numbers of Chordal, Chordless, and Some Non-Chordal Graphs

Mathematics
We prove that chordal graphs are chromatic-choosable and present a decomposition theorem to help estimate the choice numbers for certain classes of chordless and non-chordal graphs.
Julian Allagan, Jianning Su, Weizheng Gao, Shanzhen Gao   +3 more
doaj   +1 more source

On the multipacking number of grid graphs [PDF]

Discrete Mathematics & Theoretical Computer Science, 2019
In 2001, Erwin introduced broadcast domination in graphs. It is a variant of classical domination where selected vertices may have different domination powers. The minimum cost of a dominating broadcast in a graph $G$ is denoted $\gamma_b(G)$.
Laurent Beaudou, Richard C. Brewster
doaj   +1 more source

Single‐Cell RNA Sequencing of Human Lung Tissues Reveals Metallothionein‐Positive T Cells as a Novel Potential Marker of Susceptibility to Chronic Obstructive Pulmonary Disease

Advanced Science, EarlyView.
Using single‐cell RNA sequencing of lung samples and flow cytometry of peripheral blood, we identified a novel T cell subset with high metallothionein (MT) expression. These MT‐high T cells suppress CD8+ T cell cytotoxicity and are progressively depleted from healthy controls to chronic obstructive pulmonary disease (COPD) patients, positioning them as
Zengqing Liu, Xiaoxia Ren, Mi Mu, Huanyu Long, Jialu Lv, Zhihong Feng, Jie Liu, Jiajia Wang, Hui Deng, Fanyu Shi, Muzhi Zhang, Ruoyang Zhang, Yang Liu, Mengyu Xu, Yang Fan, Zengtao Wang, Zhe Lv, Yan Chen, Chris J. Corrigan, Ying Sun, Yahong Chen, Chen Chen, Ye Cui, Wei Wang   +23 more
wiley   +1 more source

Efficient (j, k)-Dominating Functions

Discussiones Mathematicae Graph Theory, 2023
For positive integers j and k, an efficient (j, k)-dominating function of a graph G = (V, E) is a function f : V → {0, 1, 2, . . ., j} such that the sum of function values in the closed neighbourhood of every vertex equals k. The relationship between the
Klostermeyer William F., MacGillivray Gary, Semnani Saeed Mohammadian, Piri Farzaneh   +3 more
doaj   +1 more source

Bounding the Clique‐Width of H‐Free Chordal Graphs [PDF]

Journal of Graph Theory, 2015
A graph is H‐free if it has no induced subgraph isomorphic to H. Brandstädt, Engelfriet, Le, and Lozin proved that the class of chordal graphs with independence number at most 3 has unbounded clique‐width.
A. Brandstädt, Konrad Dabrowski, Shenwei Huang, D. Paulusma   +3 more
semanticscholar   +1 more source

Connected graph searching in chordal graphs

Discrete Applied Mathematics, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Strongly chordal and chordal bipartite graphs are sandwich monotone

Journal of Combinatorial Optimization, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Heggernes, Pinar, Mancini, Federico, Papadopoulos, Charis, Sritharan, R.   +3 more
openaire   +3 more sources