Results 91 to 100 of about 9,193,291 (353)
Rejection sampling of bipartite graphs with given degree sequence
Acta Universitatis Sapientiae: Mathematica, 2018 Let A = (a1, a2, ..., an) be a degree sequence of a simple bipartite graph. We present an algorithm that takes A as input, and outputs a simple bipartite realization of A, without stalling.
Kayibi Koko K. +3 more
doaj +1 more source
Sequence of U-Shaped Convolutional Networks for Assessment of Degree of Delamination Around Scribe
International Journal of Computational Intelligence Systems, 2022 The application of protective layers is the primary method of keeping metallic structures resistant to degradation. The measurement of the layer resistance to delamination is one of the important indicators of the protection quality.
Veronika Rozsivalova +3 more
doaj +1 more source
Degree sequences of multigraphs
Annales Universitatis Scientiarum Budapestinensis de Rolando Eötvös Nominatae. Sectio computatorica, 2012 Let a, b and n be integers, n ≥ 1 and b ≥ a ≥ 0. Let an (a, b, n)-graph defined as a loopless graph G(a, b, n) on n vertices {V1,...,Vn}, in which Vi and Vj are connected with at least a and at most b (directed or undirected) edges. If G(a, b, n) is directed, then it is called (a, b, n)-digraph and if it is undirected, then it is called (a, b, n ...
openaire +2 more sources
FEBS Letters, EarlyView.Metabolic dysfunction‐associated steatotic liver disease (MASLD) affects nearly one‐third of the global population and poses a significant risk of progression to cirrhosis or liver cancer. Here, we discuss the roles of hepatic dendritic cell subtypes in MASLD, highlighting their distinct contributions to disease initiation and progression, and their ...
Camilla Klaimi +3 more
wiley +1 more source
A Tur\'an-type problem on degree sequence [PDF]
, 2013 Given $p\geq 0$ and a graph $G$ whose degree sequence is $d_1,d_2,\ldots,d_n$, let $e_p(G)=\sum_{i=1}^n d_i^p$. Caro and Yuster introduced a Tur\'an-type problem for $e_p(G)$: given $p\geq 0$, how large can $e_p(G)$ be if $G$ has no subgraph of a ...
Li, Xueliang, Shi, Yongtang
core
Degree sequence and supereulerian graphs [PDF]
Discrete Mathematics, 2008 AbstractA sequence d=(d1,d2,…,dn) is graphic if there is a simple graph G with degree sequence d, and such a graph G is called a realization of d. A graphic sequence d is line-hamiltonian if d has a realization G such that L(G) is hamiltonian, and is supereulerian if d has a realization G with a spanning eulerian subgraph.
Hong-Jian Lai +4 more
openaire +1 more source
Insights into PI3K/AKT signaling in B cell development and chronic lymphocytic leukemia
FEBS Letters, EarlyView.This Review explores how the phosphoinositide 3‐kinase and protein kinase B pathway shapes B cell development and drives chronic lymphocytic leukemia, a common blood cancer. It examines how signaling levels affect disease progression, addresses treatment challenges, and introduces novel experimental strategies to improve therapies and patient outcomes.
Maike Buchner
wiley +1 more source
3-Paths in Graphs with Bounded Average Degree
Discussiones Mathematicae Graph Theory, 2016 In this paper we study the existence of unavoidable paths on three vertices in sparse graphs. A path uvw on three vertices u, v, and w is of type (i, j, k) if the degree of u (respectively v, w) is at most i (respectively j, k). We prove that every graph
Jendrol Stanislav +3 more
doaj +1 more source
Making tau amyloid models in vitro: a crucial and underestimated challenge
FEBS Letters, EarlyView.This review highlights the challenges of producing in vitro amyloid assemblies of the tau protein. We review how accurately the existing protocols mimic tau deposits found in the brain of patients affected with tauopathies. We discuss the important properties that should be considered when forming amyloids and the benchmarks that should be used to ...
Julien Broc, Clara Piersson, Yann Fichou
wiley +1 more source
Parameterized binding numbers and degree sequence theorems [PDF]
Discrete Mathematics Letters, 2023 Michael Yatauro
doaj +1 more source