Results 51 to 60 of about 252,155 (281)
Making a Dominating Set of a Graph Connected
Discussiones Mathematicae Graph Theory, 2018 Let G = (V,E) be a graph and S ⊆ V. We say that S is a dominating set of G, if each vertex in V \ S has a neighbor in S. Moreover, we say that S is a connected (respectively, 2-edge connected or 2-connected) dominating set of G if G[S] is connected ...
Li Hengzhe, Wu Baoyindureng, Yang Weihua
doaj +1 more source
Approximation algorithms for connected dominating sets [PDF]
Algorithmica, 1996 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Guha, S., Khuller, S.
openaire +3 more sources
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
Exponential Domination in Subcubic Graphs
, 2015 As a natural variant of domination in graphs, Dankelmann et al. [Domination with exponential decay, Discrete Math. 309 (2009) 5877-5883] introduce exponential domination, where vertices are considered to have some dominating power that decreases ...
Bessy, Stéphane +2 more
core +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
Some techniques on nonlinear analysis and applications [PDF]
, 2010 In this paper we present two different results in the context of nonlinear analysis. The first one is essentially a nonlinear technique that, in view of its strong generality, may be useful in different practical problems.
Pellegrino, Daniel +2 more
core
Enumerating Minimal Connected Dominating Sets
SIAM Journal on Discrete MathematicszbMATH Open Web Interface contents unavailable due to conflicting licenses.
Faisal Abu-Khzam +4 more
openaire +3 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
The Forcing Geodetic Cototal Domination Number of a Graph
Ratio Mathematica, 2022 Let be a geodetic cototal domination set of . A subset is called a forcing subset for if is the unique minimum geodetic cototal domination set containing . The minimum cardinality T is the forcing geodetic cototal domination number of S is denotedby ,
S L Sumi, V Mary Gleeta, J Befija Minnie
doaj +1 more source
A Characterization of Connected (1,2)-Domination Graphs of Tournaments [PDF]
, 2011 Recently. Hedetniemi et aI. introduced (1,2)-domination in graphs, and the authors extended that concept to (1, 2)-domination graphs of digraphs. Given vertices x and y in a digraph D, x and y form a (1,2)-dominating pair if and only if for every other ...
Factor, Kim A. S., Langley, Larry J.
core +1 more source