Results 41 to 50 of about 263,414 (258)

Distance Vector Domination

This paper will appear in the proceedings of SOFSEM ...
Cordasco, Gennaro, Garagano, Luisa, Rescigno, Adele A.   +2 more
openaire   +3 more sources

Complexity and approximation ratio of semitotal domination in graphs

Communications in Combinatorics and Optimization, 2018
A set $S \subseteq V(G)$ is a semitotal dominating set of a graph $G$ if‎ ‎it is a dominating set of $G$ and‎ ‎every vertex in $S$ is within distance 2 of another vertex of $S$‎. ‎The‎ ‎semitotal domination number $\gamma_{t2}(G)$ is the minimum‎ ‎
Zehui Shao, Pu Wu
doaj   +1 more source

Superior Eccentric Domination Polynomial

Ratio Mathematica, 2023
In this paper we introduce the superior eccentric domination polynomial $SED(G, φ) = β\sum_{ l=\gamma_{sed}(G)} |sed(G, l)|φ^{l}$ where |sed(G, l)| is the number of all distinct superior eccentric dominating sets with cardinality l and $\gamma_{sed}(G ...
R Tejaskumar, A Mohamed Ismayil
doaj   +1 more source

Lower Bounds for the Total Distance $k$-Domination Number of a Graph

Theory and Applications of Graphs
For $k \geq 1$ and a graph $G$ without isolated vertices, a \emph{total distance $k$-dominating set} of $G$ is a set of vertices $S \subseteq V(G)$ such that every vertex in $G$ is within distance $k$ to some vertex of $S$ other than itself.
Randy R. Davila
doaj   +1 more source

The Parameterized Complexity of Domination-type Problems and Application to Linear Codes

, 2014
We study the parameterized complexity of domination-type problems. (sigma,rho)-domination is a general and unifying framework introduced by Telle: a set D of vertices of a graph G is (sigma,rho)-dominating if for any v in D, |N(v)\cap D| in sigma and for
D. Cattanéo, G. Galbiati, G. Gutin, H. Moser, J.A. Telle, J.A. Telle, M. Cesati, M. Cesati, M. Cesati, M.M. Halldórsson, M.R. Fellows, P.A. Golovach, R.G. Downey, R.G. Downey, R.G. Downey, S. Gravier   +15 more
core   +4 more sources

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, Ochem, Pascal, Rautenbach, Dieter   +2 more
core   +1 more source

Weak and Strong Reinforcement Number For a Graph [PDF]

, 2010
Introducing the weak reinforcement number which is the minimum number of added edges to reduce the weak dominating number, and giving some boundary of this new parameter and ...
DOGAN, Derya, DUNDAR, Pinar, TURACI, Tufan   +2 more
core   +1 more source

Structural insights into lacto‐N‐biose I recognition by a family 32 carbohydrate‐binding module from Bifidobacterium bifidum

FEBS Letters, EarlyView.
Bifidobacterium bifidum establishes symbiosis with infants by metabolizing lacto‐N‐biose I (LNB) from human milk oligosaccharides (HMOs). The extracellular multidomain enzyme LnbB drives this process, releasing LNB via its catalytic glycoside hydrolase family 20 (GH20) lacto‐N‐biosidase domain.
Xinzhe Zhang, Naoki Sunagawa, Toma Kashima, Kiyohiko Igarashi, Akimasa Miyanaga, Shinya Fushinobu   +5 more
wiley   +1 more source

Isolate g-eccentric domination in fuzzy graph

Ratio Mathematica, 2023
In a fuzzy graph G(ρ, μ), a dominating set D ⊆ P(G) is said to be g-eccentric if at least one g-eccentric vertex a of every vertex b in P − D exists in D.
S. Muthupandiyan, A Mohamed Ismayil
doaj   +1 more source

On (t,r) Broadcast Domination Numbers of Grids [PDF]

, 2014
The domination number of a graph $G = (V,E)$ is the minimum cardinality of any subset $S \subset V$ such that every vertex in $V$ is in $S$ or adjacent to an element of $S$.
Blessing, David, Insko, Erik, Johnson, Katie, Mauretour, Christie   +3 more
core