Results 51 to 60 of about 11,796 (253)
Advanced Science, EarlyView.ABSTRACT Liver metastasis is a leading cause of mortality in colorectal cancer (CRC), where the inflammatory tumor microenvironment, specifically neutrophil infiltration, significantly promotes metastatic colonization. This study reveals a pro‐metastatic role for alpha‐1 antitrypsin (A1AT) in CRC liver metastasis via a dual mechanism involving ...
Qian Fei +11 more
wiley +1 more source
The Geodetic Hull Number is Hard for Chordal Graphs
, 2017 We show the hardness of the geodetic hull number for chordal ...
Bessy, Stéphane +3 more
core +1 more source
Chordal multipartite graphs and chordal colorings
Discrete Mathematics, 2007 A graph is defined to be chordal colorable if it admits a proper vertex-coloring such that each minimal separator induces a subgraph in which two vertices are adjacent if and only if they are differently colored. All chordal graphs and all chordal bipartite graphs are chordal colorable. All chordal colorable graphs are weakly chordal.
openaire +1 more source
Decoding Spatial Heterogeneity and Multi‐Omics Regulation with Hierarchical Graph Learning
Advanced Science, EarlyView.ABSTRACT Recent advances in spatial multi‐omics technologies have enabled the simultaneous profiling of multiple molecular layers within the same tissue slice, providing unprecedented opportunities to investigate tissue spatial organization. However, most existing computational methods identify spatial domains in a purely data‐driven manner, rarely ...
Jiazhou Chen +6 more
wiley +1 more source
Choice Numbers of Chordal, Chordless, and Some Non-Chordal Graphs
MathematicsWe 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 +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
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
Discrete Applied Mathematics, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Uri N. Peled, Udi Rotics
openaire +1 more source
Advanced Science, EarlyView.In renal calcium oxalate stone formation, G6PC downregulation leads to lactate accumulation. This lactate mediates CBP/p300‐dependent lactylation of SNAIL1 at K206, promoting its nuclear translocation. Nuclear SNAIL1 activates the TGF‐β/SMAD3 pathway, driving epithelial‐mesenchymal transition and fibrosis, which ultimately facilitates crystal ...
Kai Liu +16 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. +3 more
doaj +1 more source