Results 61 to 70 of about 7,398 (287)
Protein pyrophosphorylation by inositol pyrophosphates — detection, function, and regulation
FEBS Letters, EarlyView.Protein pyrophosphorylation is an unusual signaling mechanism that was discovered two decades ago. It can be driven by inositol pyrophosphate messengers and influences various cellular processes. Herein, we summarize the research progress and challenges of this field, covering pathways found to be regulated by this posttranslational modification as ...
Sarah Lampe +3 more
wiley +1 more source
Upper bounds for domination related parameters in graphs on surfaces
AKCE International Journal of Graphs and Combinatorics, 2016 In this paper we give tight upper bounds on the total domination number, the weakly connected domination number and the connected domination number of a graph in terms of order and Euler characteristic.
Vladimir Samodivkin
doaj +1 more source
Approximation algorithms for connected dominating sets [PDF]
Algorithmica, 1996 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Guha, Sudipto, Khuller, Samir
openaire +3 more sources
Predominating a Vertex in the Connected Domination Game
Graphs and Combinatorics, 2022 The connected domination game is played just as the domination game, with an additional requirement that at each stage of the game the vertices played induce a connected subgraph. The number of moves in a D-game (an S-game, resp.) on a graph $G$ when both players play optimally is denoted by $γ_{\rm cg}(G)$ ($γ_{\rm cg}'(G)$, resp.).
Csilla Bujtás +2 more
openaire +3 more sources
Tau acetylation at K331 has limited impact on tau pathology in vivo
FEBS 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
Forcing Parameters in Fully Connected Cubic Networks
Mathematics, 2022 Domination in graphs has been extensively studied and adopted in many real life applications. The monitoring electrical power system is a variant of a domination problem called power domination problem.
Yongsheng Rao +4 more
doaj +1 more source
Calpain small subunit homodimerization is robust and calcium‐independent
FEBS 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
Perfect connected-dominant graphs
Discussiones Mathematicae Graph Theory, 2003 If \(D\) is a dominating set in a graph \(G\) and \(G[D]\) is connected, then \(D\) is a connected dominating set. The minimum size of a connected dominating set in \(G\) is called the connected domination number of \(G\), denoted by \(\gamma_c(G)\). A graph \(G\) is a perfect connected-dominant graph if \(\gamma(H)= \gamma_c(H)\) for each connected ...
openaire +2 more sources
Gut microbiome and aging—A dynamic interplay of microbes, metabolites, and the immune system
FEBS Letters, EarlyView.Age‐dependent shifts in microbial communities engender shifts in microbial metabolite profiles. These in turn drive shifts in barrier surface permeability of the gut and brain and induce immune activation. When paired with preexisting age‐related chronic inflammation this increases the risk of neuroinflammation and neurodegenerative diseases.
Aaron Mehl, Eran Blacher
wiley +1 more source
Proper connection number and connected dominating sets
Theoretical Computer Science, 2015 The proper connection number $pc(G)$ of a connected graph $G$ is defined as the minimum number of colors needed to color its edges, so that every pair of distinct vertices of $G$ is connected by at least one path in $G$ such that no two adjacent edges of the path are colored the same, and such a path is called a proper path. In this paper, we show that
Xueliang Li 0001 +2 more
openaire +3 more sources