Results 91 to 100 of about 16,468 (299)
On the Total Outer k-Independent Domination Number of Graphs
Mathematics, 2020 A set of vertices of a graph G is a total dominating set if every vertex of G is adjacent to at least one vertex in such a set. We say that a total dominating set D is a total outer k-independent dominating set of G if the maximum degree of the subgraph ...
Abel Cabrera-Martínez +3 more
doaj +1 more source
FEBS Letters, EarlyView.Fluorescent probes allow dynamic visualization of phosphoinositides in living cells (left), whereas mass spectrometry provides high‐sensitivity, isomer‐resolved quantitation (right). Their synergistic use captures complementary aspects of lipid signaling. This review illustrates how these approaches reveal the spatiotemporal regulation and quantitative
Hiroaki Kajiho +3 more
wiley +1 more source
Total dominating sequences in graphs
Discrete Mathematics, 2016 A vertex in a graph totally dominates another vertex if they are adjacent. A sequence of vertices in a graph $G$ is called a total dominating sequence if every vertex $v$ in the sequence totally dominates at least one vertex that was not totally dominated by any vertex that precedes $v$ in the sequence, and at the end all vertices of $G$ are totally ...
Bostjan Bresar +2 more
openaire +2 more sources
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
Locating-total domination in graphs [PDF]
, 2012 In this paper, we continue the study of locating-total domination in graphs. A set S of vertices in a graph G is a total dominating set in G if every vertex of G is adjacent to a vertex in S.
Jafari Rad, Nader, Henning, Michael A.
core +1 more source
Disjunctive Total Domination Subdivision Number of Graphs [PDF]
, 2020 A set S subset of V (G) is a disjunctive total dominating set of G if every vertex has a neighbor in S or has at least two vertices in S at distance 2 from it.
Aytac, Vecdi, Ciftci, Canan
core +1 more source
On the Game Total Domination Number [PDF]
Graphs and Combinatorics, 2018 11 ...
openaire +2 more sources
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
Total domination stable graphs upon edge addition [PDF]
, 2010 A set S of vertices in a graph G is a total dominating set if every vertex of G is adjacent to some vertex in S. The minimum cardinality of a total dominating set of G is the total domination number of G.
Haynes, Teresa W. +5 more
core +1 more source