Results 41 to 50 of about 310,108 (288)
ON THE DISTRIBUTION OF THE SECOND DEGREES OF CONFIGURATION GRAPHS VERTICES
Transactions of the Karelian Research Centre of the Russian Academy of Sciences, 2019 The object is configuration graphs with N vertices, numbered from 1 to N, whosevertex degrees are independent identically distributed random variables.
Elena Khvorostyanskaya
doaj +1 more source
The minimum vertex degree for an almost-spanning tight cycle in a $3$-uniform hypergraph [PDF]
, 2016 We prove that any $3$-uniform hypergraph whose minimum vertex degree is at least $\left(\frac{5}{9} + o(1) \right)\binom{n}{2}$ admits an almost-spanning tight cycle, that is, a tight cycle leaving $o(n)$ vertices uncovered.
Cooley, Oliver, Mycroft, Richard
core +2 more sources
FEBS Letters, EarlyView.Mitochondrial remodeling shapes neural and glial lineage progression by matching metabolic supply with demand. Elevated OXPHOS supports differentiation and myelin formation, while myelin compaction lowers mitochondrial dependence, revealing mitochondria as key drivers of developmental energy adaptation.
Sahitya Ranjan Biswas +3 more
wiley +1 more source
Molecules, 2019 The rhenadicarbaborane carbonyl nitrosyls (C2Bn−3Hn−1)Re(CO)2(NO), (n = 8 to 12), of interest in drug delivery agents based on the experimentally known C2B9H11Re(CO)2(NO) and related species, have been investigated by density functional ...
Amr A. A. Attia +3 more
doaj +1 more source
Counting Independent Sets of a Fixed Size in Graphs with Given Minimum Degree [PDF]
, 2014 Galvin showed that for all fixed δ and sufficiently large n, the n-vertex graph with minimum degree δ that admits the most independent sets is the complete bipartite graph .
Engbers, John, Galvin, David
core +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
Vertex decompositions of sparse graphs into an independent vertex set and a subgraph of maximum degree at most 1 [PDF]
Siberian Mathematical Journal, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Borodin, O. V., Kostochka, A. V.
openaire +1 more source
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
Extremal trees for the geometric-arithmetic index with the maximum degree [PDF]
Discrete Mathematics Letters, 2022 A. Divya, A. Manimaran
doaj +1 more source
On Domination Topological Indices of Graphs
International Journal of Analysis and Applications, 2020 Topological indices and domination in graphs are the essential topics in the theory of graphs. A set of vertices D ⊆ V (G) is said to be a dominating set for G if any vertex v ∈ V − D is adjacent to some vertex u ∈ D.
A.M. Hanan Ahmed +2 more
doaj