Results 51 to 60 of about 309,095 (284)
Matchings in 3-uniform hypergraphs
, 2012 We determine the minimum vertex degree that ensures a perfect matching in a 3-uniform hypergraph. More precisely, suppose that H is a sufficiently large 3-uniform hypergraph whose order n is divisible by 3.
Kühn, Daniela +2 more
core +1 more source
, 2016 We prove a general multi-dimensional central limit theorem for the expected number of vertices of a given degree in the family of planar maps whose vertex degrees are restricted to an arbitrary (finite or infinite) set of positive integers D. Our results rely on a classical bijection with mobiles (objects exhibiting a tree structure), combined with ...
Collet, Gwendal +2 more
openaire +2 more sources
Molecular Oncology, EarlyView.HDAC4 is degraded by the E3 ligase FBXW7. In colorectal cancer, FBXW7 mutations prevent HDAC4 degradation, leading to oxaliplatin resistance. Forced degradation of HDAC4 using a PROTAC compound restores drug sensitivity by resetting the super‐enhancer landscape, reprogramming the epigenetic state of FBXW7‐mutated cells to resemble oxaliplatin ...
Vanessa Tolotto +13 more
wiley +1 more source
FEBS Open Bio, EarlyView.Clinical analysis reveals significant dysregulation of FGFRL1 in esophageal cancer (EC) patients. RNAi‐coupled next‐generation sequencing (NGS) and in vitro study reveal FGFRL1‐mediated EC progression via EMT, PI3K/Akt, and Notch pathways. Functional assays confirm its role in tumor growth, migration, and invasion.
Aprajita Srivastava +3 more
wiley +1 more source
A Formal Treatment of Generalized Preferential Attachment and its Empirical Validation
, 2007 Generalized preferential attachment is defined as the tendency of a vertex to acquire new links in the future with respect to a particular vertex property.
A Herdağdelen +5 more
core +1 more source
Limit distributions of maximum vertex degree in a conditional configuration graph
Transactions of the Karelian Research Centre of the Russian Academy of Sciences, 2018 We consider configuration graphs with N vertices. The degrees of the vertices are independent identically distributed random variables following the power-law distribution with positive parameter τ.
Irina Cheplyukova
doaj +1 more source
On Graph Structures in Fuzzy Environment Using Optimization Parameter
IEEE Access, 2021 This paper comprises the introduction of weighted mean products of fuzzy graph structures (FGSs) to construct weighted mean fuzzy graph structures (WMFGSs) with the help of optimization parameter, and establish some novel results after validating with ...
Atiq Ur Rehman +4 more
doaj +1 more source
Further Inequalities Between Vertex-Degree-Based Topological Indices [PDF]
International Journal of Applied and Computational Mathematics, 2016 9 pages and one table ...
Ali, Akbar +2 more
openaire +3 more sources
FEBS Open Bio, EarlyView.Mouse pre‐implantation development involves a transition from totipotency to pluripotency. Integrating transcriptomics, epigenetic profiling, low‐input proteomics and functional assays, we show that eight‐cell embryos retain residual totipotency features, whereas cytoskeletal remodeling regulated by the ubiquitin‐proteasome system drives progression ...
Wanqiong Li +8 more
wiley +1 more source
On degree-sequence characterization and the extremal number of edges for various Hamiltonian properties under fault tolerance [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 Assume that $n, \delta ,k$ are integers with $0 \leq k < \delta < n$. Given a graph $G=(V,E)$ with $|V|=n$. The symbol $G-F, F \subseteq V$, denotes the graph with $V(G-F)=V-F$, and $E(G-F)$ obtained by $E$ after deleting the edges with at least one ...
Shih-Yan Chen, Shin-Shin Kao, Hsun Su
doaj +1 more source