Results 131 to 140 of about 7,042,445 (296)
Total domination and minimal total domination polynomial of H−join graphs
Let H be a connected labeled graph. In this article, we characterize all the total dominating sets and the minimal total dominating sets of H−join graphs.
Subramanian, Manikandan, Selvakumar, A.
core +1 more source
The ubiquitin system in normal and infected germinal center B cells
FEBS Letters, EarlyView.The ubiquitin system plays a central role in germinal center (GC) B cells, influencing differentiation to long‐lived memory B cells. Oncogenic gammaherpesviruses gain access to memory B cells by establishing latency in GC B cells. Mapping ubiquitin mechanisms in normal and infected GC B cells will define specific molecular circuits in B cells germane ...
Destiny Davis +2 more
wiley +1 more source
UPPER TOTAL DOMINATION VERSUS UPPER PAIRED-DOMINATION
, 2007 Let G be a graph with no isolated vertices. A set S of vertices in G is a total dominating set of G if every vertex of G is adjacent to some vertex in S, while a paired-dominating set of G is a dominating set of vertices whose induced subgraph has a ...
Mccoy, John +6 more
core
Total Domination Polynomial of A Graph [PDF]
, 2014 A total domination polynomial of a graph $G$ of order $n$ is the polynomial $D_{td}(G,x) =\sum^n_{t=\gamma_{td}(G)}d_{td}(G,t)x^t$, where $d_{td}(G,t)$ is the number of total dominating sets of $G$ of cardinality $t$.
Chaitra, V., Chaluvaraju, B.
core
Smaller is better: nanobodies meet NMR
FEBS Letters, EarlyView.Nanobodies are single‐domain antigen‐binding fragments derived from camelid heavy chain antibodies. Their small size, high stability, and exceptional specificity make nanobodies uniquely useful probes for NMR studies of protein dynamics, transient conformational states, and protein–protein interactions.
Oleg Y. Dmitriev
wiley +1 more source
On graphs for which the connected domination number is at most the total domination number. Discrete [PDF]
, 2012 In this note we give a finite forbidden subgraph characterization of the connected graphs for which any non-trivial connected induced subgraph has the property that the connected domination number is at most the total domination number.
Oliver Schaudt
core
FEBS Letters, EarlyView.Transient oligomers formed by intrinsically disordered proteins may be ‘invisible’ to direct detection yet remain accessible to solution NMR through equilibrium‐exchange measurements and pressure‐jump experiments. Complementary methods report on mass, stoichiometry, selected distance distributions, morphology, and internal packing.
Martin D. Gelenter, Ad Bax
wiley +1 more source
When the connected domination number is at most the total domination number [PDF]
, 2011 In this note we give a finite forbidden subgraph characterization of the connected graphs for which any non-trivial connected induced subgraph has the property that the connected domination number is at most the total domination number.
Schaudt, Oliver
core
Neutralization of the PTX3/CD44 axis suppresses TGF‐β1 signaling in kidney fibrosis
FEBS Letters, EarlyView.This study investigates how the PTX3/CD44 axis promotes kidney fibrosis by activating TGF‐β1 signaling. We demonstrate that the neutralizing antibody WHC‐001 effectively inhibits this pathway, suppressing myofibroblast activation and partial epithelial–mesenchymal transition (EMT).
Chao‐Chun Cheng +8 more
wiley +1 more source
Improved Total Domination and Total Roman Domination in Unit Disk Graphs
CoRRLet $G=(V, E)$ be a simple undirected graph with no isolated vertex. A set $D_t\subseteq V$ is a total dominating set of $G$ if $(i)$ $D_t$ is a dominating set, and $(ii)$ the set $D_t$ induces a subgraph with no isolated vertex. The total dominating set of minimum cardinality is called the minimum total dominating set, and the size of the minimum ...
Sasmita Rout, Gautam Kumar Das
openaire +2 more sources