Add to ORKGLet G□H denote the cartesian product of graphs G and H. Here we determine the total domination numbers of P_5 □P_n and P_6 □ P_n
AbstractA sharp lower bound for the domination number and the total domination number of the direct ...
AbstractIn this paper we discuss the total domination number with respect to the conjunction of two ...
AbstractA set S of vertices of a graph G=(V,E) with no isolated vertex is a total dominating set if ...
Let $G$ be a finite connected simple graph with a vertex set $V(G)$ and an edge set $E(G)$. A total ...
AbstractLet G□H denote the Cartesian product of graphs G and H. In this paper, we study the {k}-domi...
This paper first presents some earlier results on k-dominating sets of Cartesian products and cardin...
AbstractA set S ⊂ V of a graph G = (V,E) is a total point cover (t.p.c.) if S is a point cover conta...
AbstractIn a graph G, a vertex is said to dominate itself and all vertices adjacent to it. For a pos...
summary:If $G$ is a simple graph of size $n$ without isolated vertices and $\overline{G}$ is its com...
AbstractLet γ(G) denote the domination number of a simple graph G and let G□H denote the Cartesian p...
AbstractWe consider the {k}-domination number γ{k}(G) of a graph G and the Cartesian product G□H and...
Several domination results have been obtained for maximal outerplanar graphs (mops). The classical d...
AbstractA function f defined on the vertices of a graph G=(V,E),f:V→{-1,0,1} is a total minus domina...
Let be a simple graph on the vertex set . In a graph G, A set is a dominating set of G if every ...
AbstractA set S of vertices in a graph G is a dominating set of G if every vertex of V(G)∖S is adjac...
AbstractA sharp lower bound for the domination number and the total domination number of the direct ...
AbstractIn this paper we discuss the total domination number with respect to the conjunction of two ...
AbstractA set S of vertices of a graph G=(V,E) with no isolated vertex is a total dominating set if ...
Let $G$ be a finite connected simple graph with a vertex set $V(G)$ and an edge set $E(G)$. A total ...
AbstractLet G□H denote the Cartesian product of graphs G and H. In this paper, we study the {k}-domi...
This paper first presents some earlier results on k-dominating sets of Cartesian products and cardin...
AbstractA set S ⊂ V of a graph G = (V,E) is a total point cover (t.p.c.) if S is a point cover conta...
AbstractIn a graph G, a vertex is said to dominate itself and all vertices adjacent to it. For a pos...
summary:If $G$ is a simple graph of size $n$ without isolated vertices and $\overline{G}$ is its com...
AbstractLet γ(G) denote the domination number of a simple graph G and let G□H denote the Cartesian p...
AbstractWe consider the {k}-domination number γ{k}(G) of a graph G and the Cartesian product G□H and...
Several domination results have been obtained for maximal outerplanar graphs (mops). The classical d...
AbstractA function f defined on the vertices of a graph G=(V,E),f:V→{-1,0,1} is a total minus domina...
Let be a simple graph on the vertex set . In a graph G, A set is a dominating set of G if every ...
AbstractA set S of vertices in a graph G is a dominating set of G if every vertex of V(G)∖S is adjac...
AbstractA sharp lower bound for the domination number and the total domination number of the direct ...
AbstractIn this paper we discuss the total domination number with respect to the conjunction of two ...
AbstractA set S of vertices of a graph G=(V,E) with no isolated vertex is a total dominating set if ...