Results 81 to 90 of about 5,978,611 (274)
A new bound for the 2/3 conjecture [PDF]
, 2012 We show that any n-vertex complete graph with edges coloured with three colours contains a set of at most four vertices such that the number of the neighbours of these vertices in one of the colours is at least 2n/3.
Sereni, Jean-Sébastien +10 more
core +1 more source
Advanced Science, EarlyView.The protein aggregates and gene expression in the middle temporal gyrus (MTG) and somatosensory cortex (SOM) of the postmortem brains of 13 Alzheimer's disease patients were studied in detail, revealing that small hyperphosphorylated tau aggregates increase with Braak stage driven by microglial inflammation.
Elizabeth A. English +9 more
wiley +1 more source
Advanced Science, EarlyView.Integrative multi‐cohort analyses identify 14‐3‐3γ as a biomarker and regulator of cognitive vulnerability. Experimental studies show that 14‐3‐3γ loss is associated with Tau Thr205 phosphorylation, synaptic dysfunction, and cognitive impairment, while genetic overexpression or pharmacological stabilization of 14‐3‐3γ confers protective effects in ...
Shouqiang Zhu +5 more
wiley +1 more source
A New Type-2 Soft Set: Type-2 Soft Graphs and Their Applications
Advances in Fuzzy Systems, 2017 The correspondence between a vertex and its neighbors has an essential role in the structure of a graph. Type-2 soft sets are also based on the correspondence of primary parameters and underlying parameters.
Khizar Hayat +3 more
doaj +1 more source
Exploiting structure to cope with NP-hard graph problems: Polynomial and exponential time exact algorithms [PDF]
, 2010 An ideal algorithm for solving a particular problem always finds an optimal solution, finds such a solution for every possible instance, and finds it in polynomial time.
VAN-'T-HOF, PIM
core
Advanced Science, EarlyView.Compared to E8, mTeSR1 culture downregulated WNT and TGF‑β signaling, and upregulated neural differentiation pathways, enhancing neural priming. Under skin organoid induction conditions, mTeSR1‑cultured hESCs generated organoids with significantly higher neuroepithelial differentiation.
Zhongliang Chen +7 more
wiley +1 more source
“Follow the Leader”: A Centrality Guided Clustering and Its Application to Social Network Analysis
The Scientific World Journal, 2013 Within graph theory and network analysis, centrality of a vertex measures the relative importance of a vertex within a graph. The centrality plays key role in network analysis and has been widely studied using different methods.
Qin Wu +3 more
doaj +1 more source
Automorphisms and twisted vertex operators [PDF]
, 1987 This work is an examination of various aspects of twisted vertex operator representations of Kac-Moody algebras. It starts with an introduction to Kac-Moody algebras and string theories, including a discussion of the propagation of strings on orbifolds ...
Myhill, R.G, Myhill, Richard Graham
core
TECTB Variants Reveal Tectorial Membrane Vulnerability in Dominant Non‐Syndromic Hearing Loss
Advanced Science, EarlyView.TECTB is a non‐collagenous protein of the tectorial membrane – an extracellular matrix of the cochlea. This study identifies dominant missense variants in TECTB linked to human hereditary deafness in two unrelated families. Genetically engineered mice homozygous for one of the variants are profoundly deaf, whereas heterozygous mice have normal hearing ...
Evan B. Hale +23 more
wiley +1 more source
The locating chromatic number of (k,n)-split cycle graph and its barbell operation
Electronic Journal of Graph Theory and ApplicationsThe locating chromatic number remains an active topic in graph theory. It combines the concepts of partition dimension and proper vertex coloring. A necessary condition for determining the locating chromatic number is that each vertex must have a unique ...
Asmiati Asmiati +3 more
doaj +1 more source