Results 51 to 60 of about 444 (188)
Strongly Chordal Graph Generation using Intersection Graph Characterisation
Strongly chordal graphs are a subclass of chordal graphs. Farber also established a number of different characterisations for this class of graphs. These include an intersection graph characterisation that is analogous to a similar characterisation for chordal graphs. Seker et al. exploited this characterisation of chordal graphs to obtain an algorithm
Md. Zamilur Rahman, Asish Mukhopadhyay
openaire +2 more sources
Furrow tillage resolves the conventional‐vs.‐no‐tillage trade‐off by simultaneously cutting CO2 efflux to 2.0–3.0 g C m−2 d−1 and unlocking high nutrient availability for the rice rhizosphere. This scalable agronomic solution strengthens soil health, enhances plant physiology, reshapes microbial metabolism, and shifts paddy systems toward a net ...
Arnab Majumdar +10 more
wiley +1 more source
Total-chromatic number and chromatic index of dually chordal graphs [PDF]
Given a graph G and a vertex nu, a vertex u is an element of N(nu) is a maximum neighbor of nu if for all w is an element of N(nu) we have N(zu) subset of or equal to N(u), where N(nu) denotes the neighborhood of nu in G.
de Figueiredo, CMH +2 more
core +1 more source
Rewiring Pyroptosis to Potentiate Cancer Immunotherapy via a Gasdermin D Agonist Bypassing Caspase‐3
This work introduces a small‐molecule agonist, DIBDO, that bypasses Casp‐3 to directly trigger GSDMD‐mediated pyroptosis in tumors. Activated by glutathione, DIBDO generates singlet oxygen and molecular iodine, blocking Casp‐3 pathways and inducing immunogenic cell death.
Dan Zhao +6 more
wiley +1 more source
Vascular Aβ40 corrupts GRP78 phase behavior in brain endothelial cells, sustaining IRE1α–TRAF2–JNK signaling and driving apoptosis, tight junction loss, and blood–brain barrier failure in cerebral amyloid angiopathy. Pharmacological IRE1α inhibition restores vascular integrity, reduces leakage, and improves functional outcomes, revealing a targetable ...
Honglin Zheng +19 more
wiley +1 more source
A Characterization of Strongly Chordal Graphs [PDF]
In this paper, we present a simple characterization of strongly chordal graphs. A chordal graph is strongly chordal if and only if every cycle on six or more vertices has an induced triangle with exactly two edges of the triangle as the chords of the ...
Elias Dahlhaus +2 more
core
On P4-transversals of chordal graphs [PDF]
A P4-transversal of a graph G is a set of vertices T which meet every P4 of G. A P4-transversal T is called stable if there are no edges in the subgraph of G induced by T.
Stacho, Juraj
core +1 more source
A high‐loading Zn single‐atom nanozyme (ZMG@CS) delivers ML‐SA5 and GOx to lysosomes. ML‐SA5 activates TRPML1 to release endogenous Zn2+, while the nanozyme provides exogenous Zn2+ and GOx‐driven acidification amplifies ROS production. Together, these effects suppress the HIF‐1α/GLUT1 axis, disrupt glucose and redox homeostasis, induce disulfidptosis ...
Zhenxin Wang +12 more
wiley +1 more source
Graph Isomorphism Completeness for Chordal bipartite graphs and Strongly Chordal Graphs [PDF]
This paper deals with the graph isomorphism (GI) problem for two graph classes: chordal bipartite graphs and strongly chordal graphs. It is known that GI problem is GI complete even for some special graph classes including regular graphs, bipartite ...
Ryuhei Uehara, et al.
core
Craniofacial growth, modeling, and estimation of milestones
Abstract Understanding craniofacial growth is foundational for research into intra‐ and interspecies variation, evolution, and clinical care. The Craniofacial Growth Consortium Study (CGCS), combines cephalographs from historical growth studies to create a dense longitudinal record of growth from 6 to 22 years of age.
Richard J. Sherwood +6 more
wiley +1 more source

