Results 61 to 70 of about 636,705 (281)

Francophobia as an expression of Pan-Africanism in Francophone Africa: An exploration of the Cameroonian political and media discourse

open access: yesInkanyiso, 2020
There has over the decades been a recrudescence of francophobia in many francophone African countries. This has attracted the attention of scholars across the world and has fuelled a discourse which has myopically constructed francophone Africans ...
Floribert P.C. Endong
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  

Structural biology of ferritin nanocages

open access: yesFEBS Letters, EarlyView.
Ferritin is a conserved iron‐storage protein that sequesters iron as a ferric mineral core within a nanocage, protecting cells from oxidative damage and maintaining iron homeostasis. This review discusses ferritin biology, structure, and function, and highlights recent cryo‐EM studies revealing mechanisms of ferritinophagy, cellular iron uptake, and ...
Eloise Mastrangelo, Flavio Di Pisa
wiley   +1 more source

The Disjoint Domination Game [PDF]

open access: yes, 2014
We introduce and study a Maker-Breaker type game in which the issue is to create or avoid two disjoint dominating sets in graphs without isolated vertices.
Bujtás, Csilla, Tuza, Zsolt
core  

Tau acetylation at K331 has limited impact on tau pathology in vivo

open access: yesFEBS Letters, EarlyView.
We mapped tau post‐translational modifications in humanized MAPT knock‐in mice and in amyloid‐bearing double knock‐in mice. Acetylation within the repeat domain, particularly around K331, showed modest increases under amyloid pathology. To test functional relevance, we generated MAPTK331Q knock‐in mice.
Shoko Hashimoto   +3 more
wiley   +1 more source

Gamma-Set Domination Graphs. I: Complete Biorientations of \u3cem\u3eq-\u3c/em\u3eExtended Stars and Wounded Spider Graphs [PDF]

open access: yes, 2004
The domination number of a graph G, γ(G), and the domination graph of a digraph D, dom(D) are integrated in this paper. The γ-set domination graph of the complete biorientation of a graph G, domγ(G) is created.
Factor, Kim A. S.
core   +1 more source

Stochastic dominance, regret dominance and regret-theoretic dominance

open access: yesEURO Journal on Decision Processes, 2013
It is well known that stochastic dominance alone is insufficient for ensuring preferences when individuals experience regret. In this paper, we study two additional notions of dominance: (a) regret-theoretic dominance, which characterizes preferences in regret theory and (b) regret dominance, which characterizes preferences in mean-risk models with ...
Chin Hon Tan, Joseph C. Hartman
openaire   +1 more source

Calpain small subunit homodimerization is robust and calcium‐independent

open access: yesFEBS Letters, EarlyView.
Calpains dimerize via penta‐EF‐hand (PEF) domains. Using single‐molecule force spectroscopy, we measured the strength and kinetics of PEF–PEF homodimer binding. The interaction is robust, shows a transient conformational step before dissociation, and remains largely insensitive to Ca2+.
Nesha May O. Andoy   +4 more
wiley   +1 more source

Some techniques on nonlinear analysis and applications [PDF]

open access: yes, 2010
In this paper we present two different results in the context of nonlinear analysis. The first one is essentially a nonlinear technique that, in view of its strong generality, may be useful in different practical problems.
Pellegrino, Daniel   +2 more
core  

Domination and Fractional Domination in Digraphs

open access: yesThe Electronic Journal of Combinatorics, 2018
In this paper, we investigate the relation between the (fractional) domination number of a digraph $G$ and the independence number of its underlying graph, denoted by $\alpha(G)$. More precisely, we prove that every digraph $G$ on $n$ vertices has fractional domination number at most $2\alpha(G)$ and domination number at most $2\alpha(G) \cdot \log{n}$.
Harutyunyan, Ararat   +3 more
openaire   +5 more sources

Home - About - Disclaimer - Privacy