Results 91 to 100 of about 9,917,456 (366)

C9orf72 ALS‐causing mutations lead to mislocalization and aggregation of nucleoporin Nup107 into stress granules

open access: yesFEBS Letters, EarlyView.
Mutations in the C9orf72 gene represent the most common genetic cause of amyotrophic lateral sclerosis (ALS), a fatal neurodegenerative disease. Using patient‐derived neurons and C. elegans models, we find that the nucleoporin Nup107 is dysregulated in C9orf72‐associated ALS. Conversely, reducing Nup107 levels mitigates disease‐related changes.
Saygın Bilican   +7 more
wiley   +1 more source

Vertex-edge perfect Roman domination number

open access: yesAIMS Mathematics, 2023
A vertex-edge perfect Roman dominating function on a graph $ G = (V, E) $ (denoted by ve-PRDF) is a function $ f:V\left(G\right)\longrightarrow\{0, 1, 2\} $ such that for every edge $ uv\in E $, $ \max\{f(u), f(v)\}\neq0 $, or $ u $ is adjacent to ...
Bana Al Subaiei   +2 more
doaj   +1 more source

The domination number and the least $Q$-eigenvalue [PDF]

open access: yes, 2013
A vertex set $D$ of a graph $G$ is said to be a dominating set if every vertex of $V(G)\setminus D$ is adjacent to at least a vertex in $D$, and the domination number $\gamma(G)$ ($\gamma$, for short) is the minimum cardinality of all dominating sets of $
Guo, Shu-Guang   +3 more
core  

On graphs with equal domination and 2-domination numbers

open access: yesDiscrete Mathematics, 2008
AbstractLet G be a simple graph, and let p be a positive integer. A subset D⊆V(G) is a p-dominating set of the graph G, if every vertex v∈V(G)-D is adjacent to at least p vertices in D. The p-domination number γp(G) is the minimum cardinality among the p-dominating sets of G.
Adriana Hansberg, Lutz Volkmann
openaire   +2 more sources

Novel and unscrutinized immune entities of the zebrafish gut

open access: yesFEBS Letters, EarlyView.
Understudied cells of the zebrafish immune system include bona fide immune cells and epithelial (‐derived) cells with immune functions. Research focusing on zebrafish cells which demonstrate similarities to mammalian immune cell counterparts may help us understand the pathologies in which they are implicated. Currently available and advanced tools make
Audrey Inge Schytz Andersen‐Civil   +5 more
wiley   +1 more source

On a Relation between the Perfect Roman Domination and Perfect Domination Numbers of a Tree

open access: yesMathematics, 2020
A dominating set in a graph G is a set of vertices S ⊆ V ( G ) such that any vertex of V − S is adjacent to at least one vertex of S .
Zehui Shao   +4 more
doaj   +1 more source

Block Graphs with Large Paired Domination Multisubdivision Number

open access: yesDiscussiones Mathematicae Graph Theory, 2021
The paired domination multisubdivision number of a nonempty graph G, denoted by msdpr(G), is the smallest positive integer k such that there exists an edge which must be subdivided k times to increase the paired domination number of G.
Mynhardt Christina M., Raczek Joanna
doaj   +1 more source

From lactation to malignancy: A comparison between healthy and cancerous breast gland at single‐cell resolution reveals new issues for tumorigenesis

open access: yesFEBS Letters, EarlyView.
Single‐cell RNA sequencing reveals an opposite role of SLPI in basal tumors based on metastatic spread, along with shared activation of specific regulons in cancer cells and mature luminal lactocytes, as well as downregulation of MALAT1 and NEAT1 in the latter.
Pietro Ancona   +4 more
wiley   +1 more source

Bounding the Porous Exponential Domination Number of Apollonian Networks [PDF]

open access: yes, 2014
Given a graph G with vertex set V, a subset S of V is a dominating set if every vertex in V is either in S or adjacent to some vertex in S. The size of a smallest dominating set is called the domination number of G.
Beverly, Joshua   +3 more
core  

On the domination number and the total domination number of Fibonacci cubes

open access: yesArs Mathematica Contemporanea, 2019
Fibonacci cubes are special subgraphs of the hypercube graphs. Their domination numbers and total domination numbers are obtained for some small dimensions by integer linear programming. For larger dimensions upper and lower bounds on these numbers are given.
openaire   +3 more sources

Home - About - Disclaimer - Privacy