Results 81 to 90 of about 4,129,862 (348)
Finding planted partitions in random graphs with general degree distributions [PDF]
We consider the problem of recovering a planted partition such as a coloring, a small bisection, or a large cut in an (apart from that) random graph. In the last 30 years many algorithms for this problem have been developed that work provably well on ...
Coja-Oghlan, Amin +3 more
core +1 more source
Study case in 4-regular graph.
Realization of a random 4-regular graph with the order n = 20.
Yeftanus Antonio (11608060) +2 more
core +1 more source
Neutralization of the PTX3/CD44 axis suppresses TGF‐β1 signaling in kidney fibrosis
This study investigates how the PTX3/CD44 axis promotes kidney fibrosis by activating TGF‐β1 signaling. We demonstrate that the neutralizing antibody WHC‐001 effectively inhibits this pathway, suppressing myofibroblast activation and partial epithelial–mesenchymal transition (EMT).
Chao‐Chun Cheng +8 more
wiley +1 more source
We show that every 3-regular circle graph has at least two pairs of twin vertices; consequently no such graph is prime with respect to the split decomposition.
Traldi Lorenzo
doaj +1 more source
Factorizations of regular graphs
Let G be a k-regular graph of order 2n such that \(k\geq n\). \textit{A. J. W. Hilton} [J. Graph Theory 9, 193-196 (1985; Zbl 0624.05050)] proved that G contains at least \(\lfloor k/3\rfloor\) edge-disjoint 1-factors. Hilton's theorem is improved in this paper that G contains at least \(\lfloor k/2\rfloor\) edge-disjoint 1-factors.
Cun-Quan Zhang, Yongjin Zhu
openaire +3 more sources
Inhibition of dipeptidyl peptidase 7 impairs lysophagy in LLOMe‐treated HepG2 cells
DPP7 inhibition delays ubiquitin‐dependent lysophagy by attenuating ubiquitin accumulation and the recruitment of SQSTM1 and LC3 to damaged lysosomes, resulting in delayed clearance of damaged lysosomes and impaired restoration of lysosomal homeostasis. Created using FigureLabs (Certificate ID: FL‐PUB‐20260922‐Z99XNX).
Na Yeon Park +8 more
wiley +1 more source
On edge-graceful labeling and deficiency for regular graphs
An edge-graceful labeling of a finite simple graph with vertices and edges is a bijection from the set of edges to the set of integers such that the vertex sums are pairwise distinct modulo , where the vertex sum at a vertex is the sum of labels of all ...
Tao-Ming Wang, Guang-Hui Zhang
doaj +2 more sources
On Locating-Dominating Set of Regular Graphs
Let G be a simple, connected, and finite graph. For every vertex v∈VG, we denote by NGv the set of neighbours of v in G. The locating-dominating number of a graph G is defined as the minimum cardinality of W ⊆ VG such that every two distinct vertices u,v∈
Anuwar Kadir Abdul Gafur +1 more
doaj +1 more source
This study shows that lung adenocarcinomas exploit developmental branching morphogenesis to acquire a therapy resistant basal‐like tumour cell state. This process was found to be regulated by combined TP53 loss‐of‐function and type‐I interferon signalling, identifying a novel axis for biomarker and therapeutic target discovery.
Kamila J Bienkowska +13 more
wiley +1 more source
REGULAR NUMBER OF SUBDIVISION OF LINE GRAPH OF A GRAPH
The regular number of subdivision of line graph is the minimum number of subsets in to which the set of edges ...
Kalshetti Swati Mallinath, Vishwas
core +1 more source

