Ini this paper we establish some results on Core gular total domination in line graph L(G). Leti ai dominating set Di of V[L(G)] be ai total dominating set of L(G). If the induced subgraph li <li V>li isli regular, theni Di is ai Coregular total dominating set of L(G). The minimum cardinality of ai minimal Coregular total dominating set is a Coregulat total domination number and denoted by  
This article exposes the combinatorial formula that determines the pathdomination number in a grid g...
Let G□H denote the cartesian product of graphs G and H. Here we determine the total domination numb...
AbstractLet G=(V,E) be a simple graph. A subset S⊆V is a dominating set of G, if for any vertex u∈V-...
For any (p ,q) graph G, the middle graph of a graph G, is denoted by M(G), is a graph whose vertex s...
The middle graph of a graph G, denoted by M(G) is a graph whose vertex set is V(G)?E(G) and two vert...
summary:If $G$ is a simple graph of size $n$ without isolated vertices and $\overline{G}$ is its com...
Let G=(V,\ E) be a simple graph. A subset S of E(G) is a strong (weak) efficient edge dominating set...
The graphs considered here are finite, connected, undirected without loops or multiple edges and wit...
Let G = (V,E) be any graph with nvertices and medges. An edge dominating set which intersects every ...
AbstractLet G=(V,E) be a simple graph. A subset S of V is a dominating set of G if for any vertex v∈...
Let G=(V,E)\ be a connected graph. Let D be a minimum dominating set in G.\ If V-D contains a domina...
AbstractA set S of vertices of a graph G=(V,E) with no isolated vertex is a total dominating set if ...
AbstractLet G=(V,E) be a graph. A set S⊆V is a restrained dominating set (RDS) if every vertex not i...
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...
For any graph G=( V,E ), the block graph B(G) is a graph whose set of vertices is the union of the s...
This article exposes the combinatorial formula that determines the pathdomination number in a grid g...
Let G□H denote the cartesian product of graphs G and H. Here we determine the total domination numb...
AbstractLet G=(V,E) be a simple graph. A subset S⊆V is a dominating set of G, if for any vertex u∈V-...
For any (p ,q) graph G, the middle graph of a graph G, is denoted by M(G), is a graph whose vertex s...
The middle graph of a graph G, denoted by M(G) is a graph whose vertex set is V(G)?E(G) and two vert...
summary:If $G$ is a simple graph of size $n$ without isolated vertices and $\overline{G}$ is its com...
Let G=(V,\ E) be a simple graph. A subset S of E(G) is a strong (weak) efficient edge dominating set...
The graphs considered here are finite, connected, undirected without loops or multiple edges and wit...
Let G = (V,E) be any graph with nvertices and medges. An edge dominating set which intersects every ...
AbstractLet G=(V,E) be a simple graph. A subset S of V is a dominating set of G if for any vertex v∈...
Let G=(V,E)\ be a connected graph. Let D be a minimum dominating set in G.\ If V-D contains a domina...
AbstractA set S of vertices of a graph G=(V,E) with no isolated vertex is a total dominating set if ...
AbstractLet G=(V,E) be a graph. A set S⊆V is a restrained dominating set (RDS) if every vertex not i...
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...
For any graph G=( V,E ), the block graph B(G) is a graph whose set of vertices is the union of the s...
This article exposes the combinatorial formula that determines the pathdomination number in a grid g...
Let G□H denote the cartesian product of graphs G and H. Here we determine the total domination numb...
AbstractLet G=(V,E) be a simple graph. A subset S⊆V is a dominating set of G, if for any vertex u∈V-...
Add to ORKG