Results 31 to 40 of about 1,986,691 (177)
A new characterization of strongly chordal graphs [PDF]
, 1999 The ‘strength’ of an edge or cycle is the number of maximal complete subgraphs it is in. Strongly chordal graphs are characterized by every cycle of edges of strengths at least k with no chord of strength at least k always itself having strength at least
McKee, Terry A.
core +1 more source
Semi-dynamic algorithms for strongly chordal graphs [PDF]
, 2020 Within the broad ambit of algorithm design, the study of dynamic graph algorithms continues to be a thriving area of research. Commensurate with this interest is an extensive literature on the topic. Not surprisingly, dynamic algorithms for all varieties
Md. Zamilur Rahman, Asish Mukhopadhyay
core +1 more source
Advanced Science, EarlyView.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
On minimally tough chordal graphs [PDF]
, 2023 Katona and Varga showed that for any rational number $t \in (1/2,1]$, no chordal graph is minimally $t$-tough. We conjecture that no chordal graph is minimally $t$-tough for $t>1/2$ and prove several results supporting the conjecture.
Varga, Kitti +4 more
core +1 more source
Strongly chordal and chordal bipartite graphs are sandwich monotone
, 2011 A graph class is sandwich monotone if, for every pair of its graphs G (1)=(V,E (1)) and G (2)=(V,E (2)) with E (1)aS,E (2), there is an ordering e (1),aEuro broken vertical bar,e (k) of the edges in E (2)a-E (1) such that G=(V,E (1)a(a){e (1),aEuro ...
Heggernes, P. +3 more
core +2 more sources
MathematicsDomination problems are fundamental problems in graph theory with diverse applications in optimization, network design, and computational complexity.
Chuan-Min Lee
doaj +1 more source
Maxclique and unit disk characterizations of strongly chordal graphs [PDF]
, 2019 Maxcliques (maximal complete subgraphs) and unit disks (closed neighborhoods of vertices) sometime play almost interchangeable roles in graph theory. For instance, interchanging them makes two existing characterizations of chordal graphs into two new ...
De Caria, Pablo Jesús, McKee, Terry A.
core
Tree-layout based graph classes: proper chordal graphs
, 2022 Many standard graph classes are known to be characterized by means of layouts (a permutation of its vertices) excluding some patterns. Important such graph classes are among others: proper interval graphs, interval graphs, chordal graphs, permutation ...
Protopapas, Evangelos, Paul, Christophe
core +1 more source
Advanced Science, EarlyView.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
Advanced Science, EarlyView.ProMetNet introduces a biologically constrained deep learning framework for proteo‐metabolomic integration by embedding Reactome‐derived pathway topology into neural networks. It captures non‐linear molecular dependencies and pathway‐level metabolic reorganization, enabling interpretable discrimination.
Minghui Zhao +6 more
wiley +1 more source