Results 51 to 60 of about 756 (218)
Advanced Science, EarlyView.CHCHD10 loss in Alzheimer's disease is associated with mitochondrial dysfunction, epigenomic disruption, and tau pathology. Restoration of CHCHD10 shifts DNA methylation toward a non‐disease state and reduces tau and amyloid pathology, with KATNAL2 acting as a downstream effector.
Teresa M. Thomas +13 more
wiley +1 more source
On the shelling antimatroids of split graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 Chordal graph shelling antimatroids have received little attention with regard to their combinatorial properties and related optimization problems, as compared to the case of poset shelling antimatroids.
Jean Cardinal +2 more
doaj +1 more source
Electronic Notes in Discrete Mathematics, 2011 Matrix partition problems generalize graph colouring and homomorphism problems and occur frequently in the study of perfect graphs. It is difficult to decide, even for a small matrix M, whether the M-partition problem is polynomial time solvable or NP-complete (or possibly neither), and whether M-partitionable graphs can be characterized by a finite ...
Tomás Feder +2 more
openaire +1 more source
THBS1+ Macrophages Exacerbate Modic Changes via SDC4‐Dependent Activation of NLRP3 Inflammasome
Advanced Science, EarlyView.The illustration of THBS1+ macrophages exacerbate MCs via SDC4‐dependent activation of the NLRP3 inflammasome. THBS1+ macrophage subpopulation was identified in MCs through single‐cell RNA sequencing. C. acnes and its metabolites activate THBS1 expression in macrophages via the TLR signaling pathway.
Xiangxi Kong +16 more
wiley +1 more source
Equitable Coloring and Equitable Choosability of Planar Graphs without chordal 4- and 6-Cycles [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 A graph $G$ is equitably $k$-choosable if, for any given $k$-uniform list assignment $L$, $G$ is $L$-colorable and each color appears on at most $\lceil\frac{|V(G)|}{k}\rceil$ vertices.
Aijun Dong, Jianliang Wu
doaj +1 more source
Molecular and Cellular Hallmarks of Age‐Related Vestibular Hair Cell Degeneration
Advanced Science, EarlyView.This study utilizes single‐cell RNA‐seq transcriptomes, advanced imaging, and electrophysiology to examine universal and cell‐type‐specific aging signatures of vestibular hair cells. The study shows that impaired hair bundle function is a key driver of age‐related vestibular dysfunction.
Samadhi Kulasooriya +10 more
wiley +1 more source
The Hadwiger number, chordal graphs and -perfection
AKCE International Journal of Graphs and Combinatorics, 2017 A graph is chordal if every induced cycle has three vertices. The Hadwiger number is the order of the largest complete minor of a graph. We characterize the chordal graphs in terms of the Hadwiger number and we also characterize the families of graphs ...
Christian Rubio-Montiel
doaj +1 more source
On an edge partition and root graphs of some classes of line graphs
Electronic Journal of Graph Theory and Applications, 2017 The Gallai and the anti-Gallai graphs of a graph $G$ are complementary pairs of spanning subgraphs of the line graph of $G$. In this paper we find some structural relations between these graph classes by finding a partition of the edge set of the line ...
K Pravas, A. Vijayakumar
doaj +1 more source
Complement of the generalized total graph of fields
AKCE International Journal of Graphs and Combinatorics, 2020 Let R be a commutative ring and H be a multiplicative prime subset of R. The generalized total graph is the undirected simple graph with vertex set R and two distinct vertices x and y are adjacent if For a field F, is the only multiplicative prime subset
T. Tamizh Chelvam, M. Balamurugan
doaj +1 more source
Intersection Graphs of Pseudosegments: Chordal Graphs
Journal of Graph Algorithms and Applications, 2010 We investigate which chordal graphs have a representation as intersection graphs of pseudosegments. For positive we have a construction which shows that all chordal graphs that can be represented as intersection graph of subpaths on a tree are pseudosegment intersection graphs. We then study the limits of representability.
Cornelia Dangelmayr +2 more
openaire +3 more sources