AbstractThe bondage number b(G) of a graph G is the minimum cardinality of a set of edges of G whose removal from G results in a graph with domination number larger than that of G. Several new sharp upper bounds for b(G) are established. In addition, we present an infinite class of graphs each of whose bondage number is greater than its maximum degree plus one, thus showing a previously conjectured upper bound to be incorrect
A set $S\subseteq V(G)$ of a graph $G$ is a dominating set if each vertex has a neighbor in $S$ or b...
AbstractThe bondage number b(G) of a nonempty graph G is the cardinality of a smallest edge set whos...
AbstractThe domination number of a graph is the minimum number of vertices in a set S such that ever...
<p>The bondage number b(G) of a graph G is the smallest number<br /> of edges whose removal from G r...
AbstractThe bondage number b(G) of a graph G is the minimum cardinality of a set of edges of G whose...
AbstractA set D of vertices in a graph G is a dominating set if each vertex of G that is not in D is...
AbstractThe domination number of a graph is the minimum number of vertices in a set S such that ever...
The bondage number b(G) of a nonempty graph G is the cardinality of a smallest set of edges whose re...
The domination number γ(G) of a graph G is the minimum number of vertices in a set D such that every...
Abstract: Let G = (V, E) be a simple graph on the vertex set V . In a graph G, A set S ⊆ V is a domi...
AbstractThe bondage number b(G) of a nonempty graph G is the cardinality of a smallest set of edges ...
The bondage number b(G) of a graph G is the smallest number of edges of G whose removal results in a...
AbstractThe bondage number b(G) of a nonempty graph G is defined to be the cardinality of the smalle...
AbstractLet G=(V,E) be a simple graph. A subset S of V is a dominating set of G if for any vertex v∈...
A set $S\subseteq V(G)$ of a graph $G$ is a dominating set if each vertex has a neighbor in $S$ or b...
A set $S\subseteq V(G)$ of a graph $G$ is a dominating set if each vertex has a neighbor in $S$ or b...
AbstractThe bondage number b(G) of a nonempty graph G is the cardinality of a smallest edge set whos...
AbstractThe domination number of a graph is the minimum number of vertices in a set S such that ever...
<p>The bondage number b(G) of a graph G is the smallest number<br /> of edges whose removal from G r...
AbstractThe bondage number b(G) of a graph G is the minimum cardinality of a set of edges of G whose...
AbstractA set D of vertices in a graph G is a dominating set if each vertex of G that is not in D is...
AbstractThe domination number of a graph is the minimum number of vertices in a set S such that ever...
The bondage number b(G) of a nonempty graph G is the cardinality of a smallest set of edges whose re...
The domination number γ(G) of a graph G is the minimum number of vertices in a set D such that every...
Abstract: Let G = (V, E) be a simple graph on the vertex set V . In a graph G, A set S ⊆ V is a domi...
AbstractThe bondage number b(G) of a nonempty graph G is the cardinality of a smallest set of edges ...
The bondage number b(G) of a graph G is the smallest number of edges of G whose removal results in a...
AbstractThe bondage number b(G) of a nonempty graph G is defined to be the cardinality of the smalle...
AbstractLet G=(V,E) be a simple graph. A subset S of V is a dominating set of G if for any vertex v∈...
A set $S\subseteq V(G)$ of a graph $G$ is a dominating set if each vertex has a neighbor in $S$ or b...
A set $S\subseteq V(G)$ of a graph $G$ is a dominating set if each vertex has a neighbor in $S$ or b...
AbstractThe bondage number b(G) of a nonempty graph G is the cardinality of a smallest edge set whos...
AbstractThe domination number of a graph is the minimum number of vertices in a set S such that ever...
DOI
Add to ORKG