• Corpus ID: 14687360

Results on Total Domination and Total Restrained Domination in Grid Graphs

@inproceedings{Soltankhah2010ResultsOT,
  title={Results on Total Domination and Total Restrained Domination in Grid Graphs},
  author={Nasrin Soltankhah},
  year={2010}
}
A set S of vertices in a graph G(V, E) is called a total dominating set if every vertex v ∈ V is adjacent to an element of S. A set S of vertices in a graph G(V, E) is called a total restrained dominating set if every vertex v ∈ V is adjacent to an element of S and every vertex of V − S is adjacent to a vertex in V − S. The total domination number of a graph G denoted by γt(G) is the minimum cardinality of a total dominating set in G. Respectively the total restrained domination number of a… 
1-movable Restrained Total Domination in Graphs
A nonempty subset S of V ( G ) is a 1-movable restrained total dominating set of G if S = V ( G ) or S is a restrained total dominating set of G and for every v ∈ S , S \ { v } is a restrained total
Domination Parameters in Coronene Torus Network
TLDR
The domination number, paired-domination number, bondage number and the total bondage number for coronene torus using H-packing are determined.
Total Domination Subdivision Number in Strong Product Graph
A set D of vertices in a graph G(V,E) is called a total dominating set if every vertex v∈V is adjacent to an element of D. The domination subdivision number of a graph G is the minimum number of
Connected domination in grid graphs
TLDR
The minimum cardinality of a connected dominating set, called the connected domination number, of an m×n grid graph for any m and n is determined.
Total perfect codes, OO-irredundant and total subdivision in graphs
‎Let $G=(V(G),E(G))$ be a graph‎, ‎$gamma_t(G)$. Let $ooir(G)$ be the total domination and OO-irredundance number of $G$‎, ‎respectively‎. ‎A total dominating set $S$ of $G$ is called a $textit{total
Restrained independent dominating sets and some realization problems
TLDR
This paper defines the concept of restrained independent domination in a connected graph G and gives some characterizations involving this newly defined concept and its relationship with some of the variants of the standard domination concept.
Independent restrained domination in graphs
In this paper, we take another look at the concept of independent restrained domination in a graph. In particular, we characterize the independent restrained dominating sets in the join G + H, corona
Total restrained domination in products of graphs
In this paper we characterize the total restrained dominating sets in the join, corona, lexicographic product, cartesian product, and tensor product of two connected graphs. The corresponding upper
The Golden Partition Conjecture problem 1 posed by Marcin Peczarski
The Golden Partition Conjecture is motivated by conjectures whose root is a famous sorting problem. Imagine that a finite set S with cardinality n has a hidden total order ≺ that we would like to
Results on Total Restrained Domination number and subdivision number for certain graphs
Abstract In this paper we determine the total restrained domination number and subdivision number for andrásfai graph, chvatal graph, wheel graph, windmill graph and strong product graph.
...
...

References

SHOWING 1-10 OF 19 REFERENCES
Results on Total Restrained Domination in Graphs
Let G =( V, E) be a graph. A set S ⊆ V (G) is a total restrained dominating set if every vertex of G is adjacent to a vertex in S and every vertex of V (G)\S is adjacent to a vertex in V (G)\S. The
Total domination in graphs
TLDR
Results concerning the total domination number of G (the smallest number of vertices in a total dominating set) and the total domatic number ofG (the largest order of a partition of G into total dominating sets) are obtained.
3-Tuple domination number in complete grid graphs
In a graph G, a vertex dominates itself and its neighbors. A subset S ⊆ V (G )i s ak-tuple dominating set of G if each vertex of G is dominated by at least k vertices of S .A k-tuple dominating set S
Some results on domination number of products of graphs
Abstract.Let G= (V,E) be a simple graph. A subset D of V is called a dominating set of G if for every vertex κ,εV—D,κ is adjacent to at least one vertex of D. Let γ(G) and γc(G) denote the domination
Dominating Cartesian Products of Cycles
Total domination number of grid graphs
Algorithms for Vertex Partitioning Problems on Partial k-Trees
TLDR
A design methodology of practical solution algorithms for generally $\NP$-hard problems when restricted to partial k-trees (graphs with treewidth bounded by k) is presented, which accounts for dependency on the parameter k of the computational complexity of the resulting algorithms.
Domination in graphs : advanced topics
LP-duality, complementarity and generality of graphical subset parameters dominating functions in graphs fractional domination and related parameters majority domination and its generalizations
Fundamentals of domination in graphs
Bounds on the domination number domination, independence and irredundance efficiency, redundancy and the duals changing and unchanging domination conditions on the dominating set varieties of
Total domination numbers of cartesian products
Let $G\Box H$ denote the cartesian product of graphs G and H. Here we determine the total domination numbers of $P_5\Box P_n$ and $P_6\Box P_n$.
...
...