Results 21 to 30 of about 252,155 (281)
Approximating k-Connected m-Dominating Sets [PDF]
Algorithmica, 2022 A subset $S$ of nodes in a graph $G$ is a $k$-connected $m$-dominating set ($(k,m)$-cds) if the subgraph $G[S]$ induced by $S$ is $k$-connected and every $v \in V \setminus S$ has at least $m$ neighbors in $S$. In the $k$-Connected $m$-Dominating Set ($(k,m)$-CDS) problem the goal is to find a minimum weight $(k,m)$-cds in a node-weighted graph. For $m
openaire +5 more sources
Weakly connected domination stable trees [PDF]
Czechoslovak Mathematical Journal, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lemańska, Magdalena, Raczek, Joanna
openaire +2 more sources
The Detour Domination and Connected Detour Domination values of a graph
Ratio Mathematica, 2022 The number of -sets that belongs to in G is defined as the detour domination value of indicated by for each vertex . In this article, we examined at the concept of a graph’s detour domination value.
R.V Revathi, M Antony
doaj +1 more source
Disjunctive Total Domination in Graphs [PDF]
, 2014 Let $G$ be a graph with no isolated vertex. In this paper, we study a parameter that is a relaxation of arguably the most important domination parameter, namely the total domination number, $\gamma_t(G)$.
Henning, Michael A., Naicker, Viroshan
core +1 more source
Connected domination critical graphs
Applied Mathematics Letters, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chen, Xue-Gang, Sun, Liang, Ma, De-Xiang
openaire +1 more source
Outer-weakly convex domination number of graphs [PDF]
Communications in Combinatorics and Optimization, 2020 For a given simple graph $G=(V,E)$, a set $S\subseteq V$ is an outer-weakly convex dominating set if every vertex in $V\setminus S$ is adjacent to some vertex in $S$ and $V\setminus S$ is a weakly convex set.
Jonecis A. Dayap +2 more
doaj +1 more source
Applicable Analysis and Discrete Mathematics, 2019 In this paper we introduce a domination game based on the notion of connected domination. Let G = (V,E) be a connected graph of order at least 2. We define a connected domination game on G as follows: The game is played by two players, Dominator and Staller. The players alternate taking turns choosing a vertex of G (Dominator starts).
Borowiecki, Mieczyslaw +2 more
openaire +2 more sources
Structural Properties of Connected Domination Critical Graphs
Mathematics, 2021 A graph G is said to be k-γc-critical if the connected domination number γc(G) is equal to k and γc(G+uv)
Norah Almalki, Pawaton Kaemawichanurat
doaj +1 more source
Computation of Various Domination Numbers of Rolf Nevanlinna (RNP) Collaboration Graph
Brazilian Archives of Biology and Technology, 2017 In this paper, we compute various Domination numbers like Outer Connected Domination (OCD), Doubly Connected Domination (DCD), Fair Domination (FD), Independence Domination (ID), 2-Packing (2-P) for Rolf Nevanlinna Prize Winners's Collaboration Graph ...
Yegnanarayanan V, Logeshwary B
doaj +1 more source
Connected Dominating Sets [PDF]
, 2009 Wireless sensor networks (WSNs) are now widely used in many applications. However, routing in WSNs is very challenging due to the inherent characteristics that distinguish these networks from other wireless networks. The concept of hierarchical routing is widely used to perform energy-efficient routing in WSNs.
Yiwei Wu, Yingshu Li
openaire +1 more source