Results 41 to 50 of about 41,065 (264)
Hamiltonicity of 3tEC Graphs with α=κ+1
Journal of Mathematics, 2021 A set S of vertices in a graph G is a total dominating set of G 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 γtG of G.
Huanying He, Xinhui An, Zongjun Zhao
doaj +1 more source
On total dominating sets in graphs
, 2008 5 ...
Atapour, Maryam, Soltankhah, Nasrin
openaire +2 more sources
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
3-Tuple Total Domination Number of Rook’s Graphs
Discussiones Mathematicae Graph Theory, 2022 A k-tuple total dominating set (kTDS) of a graph G is a set S of vertices in which every vertex in G is adjacent to at least k vertices in S. The minimum size of a kTDS is called the k-tuple total dominating number and it is denoted by γ×k,t(G).
Pahlavsay Behnaz +2 more
doaj +1 more source
An Approximation Algorithm for a Variant of Dominating Set Problem
Axioms, 2023 In this paper, we consider a variant of dominating set problem, i.e., the total dominating set problem. Given an undirected graph G=(V,E), a subset of vertices T⊆V is called a total dominating set if every vertex in V is adjacent to at least one vertex ...
Limin Wang, Wenqi Wang
doaj +1 more source
By dawn or dusk—how circadian timing rewrites bacterial infection outcomes
FEBS Letters, EarlyView.The circadian clock shapes immune function, yet its influence on infection outcomes is only beginning to be understood. This review highlights how circadian timing alters host responses to the bacterial pathogens Salmonella enterica, Listeria monocytogenes, and Streptococcus pneumoniae revealing that the effectiveness of immune defense depends not only
Devons Mo +2 more
wiley +1 more source
An upper bound on the total outer-independent domination number of a tree [PDF]
Opuscula Mathematica, 2012 A total outer-independent dominating set of a graph \(G=(V(G),E(G))\) is a set \(D\) of vertices of \(G\) such that every vertex of \(G\) has a neighbor in \(D\), and the set \(V(G) \setminus D\) is independent.
Marcin Krzywkowski
doaj +1 more source
Trees with unique minimum total dominating sets
Discussiones Mathematicae Graph Theory, 2002 A set \(S\) of vertices of a graph \(G\) is a total dominating set if every vertex of \(G\) is adjacent to some vertex in \(S\). Three equivalent conditions for a tree to have a unique minimum total dominating set together with a constructive characterization of such trees are given.
Haynes, Teresa W., Henning, Michael A.
openaire +1 more source
Crosstalk between the ribosome quality control‐associated E3 ubiquitin ligases LTN1 and RNF10
FEBS Letters, EarlyView.Loss of the E3 ligase LTN1, the ubiquitin‐like modifier UFM1, or the deubiquitinating enzyme UFSP2 disrupts endoplasmic reticulum–ribosome quality control (ER‐RQC), a pathway that removes stalled ribosomes and faulty proteins. This disruption may trigger a compensatory response to ER‐RQC defects, including increased expression of the E3 ligase RNF10 ...
Yuxi Huang +8 more
wiley +1 more source
On the total domatic number of regular graphs [PDF]
Transactions on Combinatorics, 2012 A set S of vertices of a graph G = (V;E) without isolated vertex is a total dominating set if every vertex of V (G) is adjacent to some vertex in S.
H. Aram +2 more
doaj