Results 1 to 10 of about 36,632 (251)
Trees With Equal Domination and Paired-Domination Numbers
Ars Comb., 2005 A paired-dominating set of a graph G is a dominating set of vertices whose induced subgraph has a perfect matching. The paired-domination number of G is the minimum cardinality of a paired-dominating set of G, and is obviously bounded below by the ...
Haynes, Teresa W. +2 more
core +1 more source
Min-Max Dom-Saturation Number of a Tree [PDF]
, 2010 In this paper we present a dynamic programming algorithm for determining the min-max domsaturation number of a ...
Sudha, S., Arumugam, S.
core +1 more source
Paired-Domination in Grid Graphs.
, 2001 Every graph G = (V, E) has a dominating set S ⊆ V(G) such that any vertex not in S is adjacent to a vertex in S. We define a paired-dominating set S to be a dominating set S = {v1, v2,..., v2t-1, v2t} where M = {v1v2, v3v4, ..., v2t-1v2t} is a perfect ...
Proffitt, Kenneth Eugene
core
Secure paired domination in graphs
, 2010 This thesis introduces a new strategy of defending the vertices of a graph - secure paired domination, where guards are required to be paired and, when a vertex is attacked, one or two guards move to defend the attacked vertex, while keeping the graph
Kang, Jian
core
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
Induced-Paired Domination in Graphs
, 2000 For a graph G = (V, E), a set S ⊆ V is a dominating set if every vertex in V - S is adjacent to at least one vertex in S. A dominating set S ⊆ V is a paired-dominating set if the induced subgraph 〈S〉 has a perfect matching.
Haynes, Teresa W. +2 more
core
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
Parameterized Complexity of Paired Domination [PDF]
The Paired Domination problem is one of the well-studied variants of the classical Dominating Set problem. In a graph G on nvertices, a dominating set D (set of vertices such that N[D] = V (G)) is called a paired dominating set of G, if G[D] has perfect ...
Tripathi, Vikash +5 more
core +1 more source
Product throttling for power domination
, 2023 The product power throttling number of a graph is defined to study product throttling for power domination. The domination number of a graph is an upper bound for its product power throttling number.
Trenk, Ann +6 more
core
On Paired and Double Domination in Graphs
, 2005 A paired dominating set of a graph G is a dominating set of vertices whose induced subgraph has a perfect matching, and a double dominating set is a dominating set that dominates every vertex of G at least twice.
Haynes, Teresa W., Chellali, Mustapha
core