Results 41 to 50 of about 2,971,508 (208)

On composition of signed graphs [PDF]

open access: yes, 2012
A graph whose edges are labeled either as positive or negative is called a signed graph. In this article, we extend the notion of composition of (unsigned) graphs (also called lexicographic product) to signed graphs.
Shahul Hameed, K., Germina, K.
core   +1 more source

Transient Sleep Deprivation Induces Persistent Auditory Neuropathy via ROS‐Initiated Neuroinflammation and BK Channel Suppression

open access: yesAdvanced Science, EarlyView.
Sleep disturbance severity closely tracks hearing loss in a clinical cohort, yet the mechanistic link remains unclear. Acute sleep deprivation is shown to trigger transient cochlear oxidative stress that switches into a self‐sustaining neuroinflammatory state, suppressing BK channels and causing irreversible synaptopathy.
Dan Chen   +11 more
wiley   +1 more source

The n-th Power Signed Graphs-II [PDF]

open access: yes, 2010
For standard terminology and notion in graph theory we refer the reader to Harary [6]; the non-standard will be given in this paper as and when required.
Reddyy, P. Siva Kota   +2 more
core   +1 more source

Molecular Glue Degraders Enhance CAPRIN1‐Dependent Lysosomal Degradation of APP and Reduce Amyloid β in Alzheimer's Disease

open access: yesAdvanced Science, EarlyView.
A new class of lysosome‐directed molecular glue degraders selectively enhance CAPRIN1–APP interactions, driving APP degradation and reducing amyloid‐β production in human neurons and Alzheimer's disease mouse models. This CAPRIN1‐dependent targeted protein degradation strategy reveals a previously unrecognized therapeutic approach for disrupting the ...
Sunghan Jung   +15 more
wiley   +1 more source

Crown reductions for the Minimum Weighted Vertex Cover problem [PDF]

open access: yes, 2004
The paper studies crown reductions for the Minimum Weighted Vertex Cover problem introduced recently in the unweighted case by Fellows et al. [Blow-Ups, Win/Win's and crown rules: some new directions in FPT, in: Proceedings of the 29th International ...
Chlebikova, Janka   +5 more
core   +1 more source

Complexity of planar signed graph homomorphisms to cycles

open access: yes, 2020
International audienceWe study homomorphism problems of signed graphs from a computational point of view. A signed graph is an undirected graph where each edge is given a sign, positive or negative. An important concept when studying signed graphs is the
Mitsou, Valia   +4 more
core   +1 more source

A Note on Path Signed Digraphs [PDF]

open access: yes, 2010
The concept of a line signed digraph is generalized to that of a path signed ...
S. Vijay   +5 more
core   +1 more source

Temporal Trajectories of the Tau Aggregate Interactome Reveal Stage‐Specific Vulnerabilities in Alzheimer's Disease

open access: yesAdvanced Science, EarlyView.
Tau populations with different aggregation states associate with distinct sets of proteins in the Alzheimer's disease brain. Proteomic discovery combined with single‐molecule analysis in neurons reveals dynamic associations involving proteostasis, metabolism and RNA biology.
Dorothea Böken   +8 more
wiley   +1 more source

AI‐Designed TREM1‐Targeted LYTAC Nanoparticles Reprogram the Neuroimmune Microenvironment in Traumatic Brain Injury

open access: yesAdvanced Science, EarlyView.
AI‐enabled de novo design of a TREM1 binder, integrated into a BBB‐crossing and macrophage‐targeted nanoplatform, enables TREM1 degradation and attenuates neuroinflammation, thereby promoting neuroprotection and tissue repair after traumatic brain injury. ABSTRACT Secondary neuroinflammation drives progressive damage after traumatic brain injury (TBI),
Yimin Huang   +19 more
wiley   +1 more source

Connected signed graphs L-cospectral to signed ∞-graphs

open access: yes, 2019
A signed graph is a pair (G,sigma), where G is a graph and sigma is the sign function on the edges of G. For a signed graph we consider the Laplacian matrix defined as L=D-A, where D is the matrix of vertex degrees of G and A the (signed) adjacency ...
Brunetti, Maurizio, Belardo, Francesco
core   +1 more source

Home - About - Disclaimer - Privacy