Add to ORKGIn a graph G = (V(G),E(G)), a vertex dominates itself and its neighbors. A subset S of V(G) is a double dominating set if every vertex of V(G) is dominated at least twice by the vertices of S. The double domination number of G is the minimum cardinality among all double dominating sets of G. We consider the effects of edge removal on the double domination number of a graph. We give a necessary and sufficient condition for a graph to have the property that the double domination number is unchanged upon the removal of any edge. Then we give a constructive characterization of trees having this property for every non-pendant edge
A set of vertices in a graph G is a global dominating set of G if it dominates both G and its comple...
critical, double domination edge critical Double Domination Edge Critical Graphs by Derrick Wayne Th...
A set of vertices in a graph G is a global dominating set of G if it dominates both G and its comple...
In a graph a vertex is said to dominate itself and all its neighbors. A double dominating set of a g...
In a graph a vertex is said to dominate itself and all its neighbors. A double dominating set of a g...
In a graph G, a vertex dominates itself and its neighbors. A subset S of vertices of G is a double d...
In a graph G = (V,E), a subset S ⊆ V is a double dominating set if every vertex in V is dominated at...
In a graph G = (V,E), a subset S ⊆ V is a double dominating set if every vertex in V is dominated at...
In a graph G = (V,E), a subset S ⊆ V is a double dominating set if every vertex in V is dominated at...
Each vertex of a graph G = (V, E) is said to dominate every vertex in its closed neighborhood. A set...
A total edge dominating set of a graph G is a set D of edges of G such that the sub graph D has no i...
Abstract. A vertex of a graph is said to dominate itself and all of its neighbors. A subset D ⊆ V (G...
In a graph G = (V, E), a vertex dominates itself and its neighbors. A subset S of vertices of V is a...
AbstractIn a graph G, a vertex dominates itself and its neighbors. A subset S⊆V(G) is a double domin...
Let G = (V,E) be a graph with vertex set V and edge set E. A vertex v ∈ V (G) is said to dominate it...
A set of vertices in a graph G is a global dominating set of G if it dominates both G and its comple...
critical, double domination edge critical Double Domination Edge Critical Graphs by Derrick Wayne Th...
A set of vertices in a graph G is a global dominating set of G if it dominates both G and its comple...
In a graph a vertex is said to dominate itself and all its neighbors. A double dominating set of a g...
In a graph a vertex is said to dominate itself and all its neighbors. A double dominating set of a g...
In a graph G, a vertex dominates itself and its neighbors. A subset S of vertices of G is a double d...
In a graph G = (V,E), a subset S ⊆ V is a double dominating set if every vertex in V is dominated at...
In a graph G = (V,E), a subset S ⊆ V is a double dominating set if every vertex in V is dominated at...
In a graph G = (V,E), a subset S ⊆ V is a double dominating set if every vertex in V is dominated at...
Each vertex of a graph G = (V, E) is said to dominate every vertex in its closed neighborhood. A set...
A total edge dominating set of a graph G is a set D of edges of G such that the sub graph D has no i...
Abstract. A vertex of a graph is said to dominate itself and all of its neighbors. A subset D ⊆ V (G...
In a graph G = (V, E), a vertex dominates itself and its neighbors. A subset S of vertices of V is a...
AbstractIn a graph G, a vertex dominates itself and its neighbors. A subset S⊆V(G) is a double domin...
Let G = (V,E) be a graph with vertex set V and edge set E. A vertex v ∈ V (G) is said to dominate it...
A set of vertices in a graph G is a global dominating set of G if it dominates both G and its comple...
critical, double domination edge critical Double Domination Edge Critical Graphs by Derrick Wayne Th...
A set of vertices in a graph G is a global dominating set of G if it dominates both G and its comple...