Add to ORKGAbstract. Total domination number of a graph without isolated vertex is the minimum cardinality of a total dominating set, that is, a set of vertices such that every vertex of the graph is adjacent to at least one vertex of the set. Henning and Kazemi in [4] extended this definition as follows: for any positive integer k, and any graph G with minimum degree-k, a set D of vertices is a k-tuple total dominating set of G if each vertex of G is adjacent to at least k vertices in D. The k-tuple total domination number γ×k,t(G) of G is the minimum cardinality of a k-tuple total dominating set of G. In this paper, we give some upper bounds for the k-tuple total domination number of the supergeneralized Petersen graphs. Also we calculate the exact ...
In this paper, we provide an upper bound for the k-tuple domination number that generalises known up...
AbstractThe following fundamental result for the domination number γ(G) of a graph G was proved by A...
Let k ≥ 1 be an integer and G be a graph of minimum degree δ(G) ≥ k − 1. A set D ⊆ V(G) is said to b...
AbstractA set S of vertices in a graph G is a k-tuple total dominating set, abbreviated kTDS, of G i...
AbstractIn a graph G, a vertex is said to dominate itself and all vertices adjacent to it. For a pos...
A subset S of VG is called a total dominating set of a graph G if every vertex in VG is adjacent to ...
Abstract: A total dominating set of a graph G is a set of the vertex set V of G such that every vert...
Let k be a positive integer and let G = (V,E) be a simple graph. The k-tuple domination number $γ_{×...
A total dominating set of a graph G with no isolated vertex is a set 5 of vertices of G such that ev...
Let G = (V, E) be a graph; a set S ⊆ V is a total k-dominating set if every vertex v ∈ V has at leas...
A total dominating set of a graph G with no isolated vertex is a set 5 of vertices of G such that ev...
A total dominating set of a graph G with no isolated vertex is a set 5 of vertices of G such that ev...
AbstractLet G=(V,E) be a graph with no isolated vertex. A subset of vertices S is a total dominating...
A set S of vertices in a graph G is a total dominating set of G if every vertex of G is adjacent to ...
A set S of vertices in a graph G is a total dominating set of G if every vertex of G is adjacent to ...
In this paper, we provide an upper bound for the k-tuple domination number that generalises known up...
AbstractThe following fundamental result for the domination number γ(G) of a graph G was proved by A...
Let k ≥ 1 be an integer and G be a graph of minimum degree δ(G) ≥ k − 1. A set D ⊆ V(G) is said to b...
AbstractA set S of vertices in a graph G is a k-tuple total dominating set, abbreviated kTDS, of G i...
AbstractIn a graph G, a vertex is said to dominate itself and all vertices adjacent to it. For a pos...
A subset S of VG is called a total dominating set of a graph G if every vertex in VG is adjacent to ...
Abstract: A total dominating set of a graph G is a set of the vertex set V of G such that every vert...
Let k be a positive integer and let G = (V,E) be a simple graph. The k-tuple domination number $γ_{×...
A total dominating set of a graph G with no isolated vertex is a set 5 of vertices of G such that ev...
Let G = (V, E) be a graph; a set S ⊆ V is a total k-dominating set if every vertex v ∈ V has at leas...
A total dominating set of a graph G with no isolated vertex is a set 5 of vertices of G such that ev...
A total dominating set of a graph G with no isolated vertex is a set 5 of vertices of G such that ev...
AbstractLet G=(V,E) be a graph with no isolated vertex. A subset of vertices S is a total dominating...
A set S of vertices in a graph G is a total dominating set of G if every vertex of G is adjacent to ...
A set S of vertices in a graph G is a total dominating set of G if every vertex of G is adjacent to ...
In this paper, we provide an upper bound for the k-tuple domination number that generalises known up...
AbstractThe following fundamental result for the domination number γ(G) of a graph G was proved by A...
Let k ≥ 1 be an integer and G be a graph of minimum degree δ(G) ≥ k − 1. A set D ⊆ V(G) is said to b...