Results 71 to 80 of about 398,878 (275)

Acyclic total dominating sets in cubic graphs

open access: yesApplicable Analysis and Discrete Mathematics, 2019
We show that every cubic graph has a total dominating set D such that the subgraph induced by D is acyclic. As a consequence, an old result attributed to Berge follows.
Goddard, Wayne, Henning, Michael A.
openaire   +2 more sources

A characterization of graphs with disjoint total dominating sets

open access: yesArs Mathematica Contemporanea, 2019
Summary: A set \(S\) of vertices in a graph \(G\) is a total dominating set of \(G\) if every vertex is adjacent to a vertex in \(S\). A fundamental problem in total domination theory in graphs is to determine which graphs have two disjoint total dominating sets.
Henning, Michael A., Peterin, Iztok
openaire   +4 more sources

Protein pyrophosphorylation by inositol pyrophosphates — detection, function, and regulation

open access: yesFEBS 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

Total 2-Rainbow Domination Numbers of Trees

open access: yesDiscussiones Mathematicae Graph Theory, 2021
A 2-rainbow dominating function (2RDF) of a graph G = (V (G), E(G)) is a function f from the vertex set V (G) to the set of all subsets of the set {1, 2} such that for every vertex v ∈ V (G) with f(v) = ∅ the condition ∪u∈N(v)f(u) = {1, 2} is fulfilled ...
Ahangar H. Abdollahzadeh   +4 more
doaj   +1 more source

Total domination versus paired domination [PDF]

open access: yes, 2011
A dominating set of a graph G is a vertex subset that any vertex of G either belongs to or is adjacent to. A total dominating set is a dominating set whose induced subgraph does not contain isolated vertices.
Schaudt, Oliver
core  

The newfound relationship between extrachromosomal DNAs and excised signal circles

open access: yesFEBS Letters, EarlyView.
Extrachromosomal DNAs (ecDNAs) contribute to the progression of many human cancers. In addition, circular DNA by‐products of V(D)J recombination, excised signal circles (ESCs), have roles in cancer progression but have largely been overlooked. In this Review, we explore the roles of ecDNAs and ESCs in cancer development, and highlight why these ...
Dylan Casey, Zeqian Gao, Joan Boyes
wiley   +1 more source

Total Domination Versus Paired-Domination in Regular Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2018
A subset S of vertices of a graph G is a dominating set of G if every vertex not in S has a neighbor in S, while S is a total dominating set of G if every vertex has a neighbor in S. If S is a dominating set with the additional property that the subgraph
Cyman Joanna   +4 more
doaj   +1 more source

In situ molecular organization and heterogeneity of the Legionella Dot/Icm T4SS

open access: yesFEBS Letters, EarlyView.
We present a nearly complete in situ model of the Legionella Dot/Icm type IV secretion system, revealing its central secretion channel and identifying new components. Using cryo‐electron tomography with AI‐based modeling, our work highlights the structure, variability, and mechanism of this complex nanomachine, advancing understanding of bacterial ...
Przemysław Dutka   +11 more
wiley   +1 more source

Two Short Proofs on Total Domination

open access: yesDiscussiones Mathematicae Graph Theory, 2013
A set of vertices of a graph G is a total dominating set if each vertex of G is adjacent to a vertex in the set. The total domination number of a graph Υt (G) is the minimum size of a total dominating set.
Bickle Allan
doaj   +1 more source

The Algorithmic Complexity of Bondage and Reinforcement Problems in bipartite graphs [PDF]

open access: yes, 2014
Let $G=(V,E)$ be a graph. A subset $D\subseteq V$ is a dominating set if every vertex not in $D$ is adjacent to a vertex in $D$. The domination number of $G$, denoted by $\gamma(G)$, is the smallest cardinality of a dominating set of $G$.
Hu, Fu-Tao, Sohn, Moo Young
core  

Home - About - Disclaimer - Privacy