A graph G is domination bicritical if the removal of any pair of vertices decreases the domination number. Properties of bicritical graphs are studied. We show that a connected bicritical graph has domination number at least 3, minimum degree at least 3, and edge-connectivity at least 2. Ways of constructing a bicritical graph from smaller bicritical graphs are presented. © 2005 Elsevier B.V. All rights reserved
A subset of vertices D of a graph G is a dominating set for G if every vertex of G not in D is adjac...
Finding a minimum connected dominating set (connected domination) is known-complete for chordal bipa...
summary:The paper studies the signed domination number and the minus domination number of the comple...
A graph G is domination bicritical if the removal of any pair of vertices decreases the domination n...
A graph G is domination bicritical if the removal of any pair of vertices decreases the domination n...
AbstractA graph G is domination bicritical if the removal of any pair of vertices decreases the domi...
A set S of vertices in a graph G is a global dominating set of G if 5 simultaneously dominates both ...
A set S of vertices of a graph G is distinguishing if the sets of neighbors in S for every pair of v...
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 = (V(G),E(G)), a vertex dominates itself and its neighbors. A subset S of V(G) is a dou...
In a graph G = (V, E) each vertex is said to dominate every vertex in its closed neighborhood. In a ...
In a graph a vertex is said to dominate itself and all its neighbors. A double dominating set of a g...
AbstractA graph G is said to be k–γ-critical if the size of any minimum dominating set of vertices i...
summary:In this paper we present results on changing and unchanging of the domination number with re...
AbstractA dominating set of a graph G=(V,E) is a subset S⊆V such that every vertex not in S is adjac...
A subset of vertices D of a graph G is a dominating set for G if every vertex of G not in D is adjac...
Finding a minimum connected dominating set (connected domination) is known-complete for chordal bipa...
summary:The paper studies the signed domination number and the minus domination number of the comple...
A graph G is domination bicritical if the removal of any pair of vertices decreases the domination n...
A graph G is domination bicritical if the removal of any pair of vertices decreases the domination n...
AbstractA graph G is domination bicritical if the removal of any pair of vertices decreases the domi...
A set S of vertices in a graph G is a global dominating set of G if 5 simultaneously dominates both ...
A set S of vertices of a graph G is distinguishing if the sets of neighbors in S for every pair of v...
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 = (V(G),E(G)), a vertex dominates itself and its neighbors. A subset S of V(G) is a dou...
In a graph G = (V, E) each vertex is said to dominate every vertex in its closed neighborhood. In a ...
In a graph a vertex is said to dominate itself and all its neighbors. A double dominating set of a g...
AbstractA graph G is said to be k–γ-critical if the size of any minimum dominating set of vertices i...
summary:In this paper we present results on changing and unchanging of the domination number with re...
AbstractA dominating set of a graph G=(V,E) is a subset S⊆V such that every vertex not in S is adjac...
A subset of vertices D of a graph G is a dominating set for G if every vertex of G not in D is adjac...
Finding a minimum connected dominating set (connected domination) is known-complete for chordal bipa...
summary:The paper studies the signed domination number and the minus domination number of the comple...
DOI
Add to ORKG