AbstractThe bondage number b(G) of a nonempty graph G is the cardinality of a smallest edge set whose removal from G results in a graph with domination number greater than the domination number γ(G) of G. Kang and Yuan proved b(G)⩽8 for every connected planar graph G. Fischermann, Rautenbach and Volkmann obtained some further results for connected planar graphs. In this paper, we generalize their results to connected graphs with small crossing numbers
AbstractLet G=(V,E) be a simple graph. A subset S of V is a dominating set of G if for any vertex v∈...
The domination number γG of a nonempty graph G is the minimum cardinality among all subsets D⊆VG suc...
20 pages, 12 figuresA set $S\subseteq V(G)$ of a graph $G$ is a dominating set if each vertex has a ...
AbstractThe bondage number b(G) of a nonempty graph G is the cardinality of a smallest set of edges ...
AbstractThe bondage number b(G) of a nonempty graph G is defined to be the cardinality of the smalle...
AbstractThe bondage number b(G) of a nonempty graph G is the cardinality of a smallest edge set whos...
AbstractA set D of vertices in a graph G is a dominating set if each vertex of G that is not in D is...
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 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...
AbstractThe bondage number b(G) of a graph G is the minimum cardinality of a set of edges of G whose...
The domination number γ(G) of a graph G is the minimum number of vertices in a set D such that every...
<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 nonempty graph G is defined to be the cardinality of the smalle...
Let G(V(G), E(G)) be a simple undirected graph. A dominating set of G is a subset D ? V(G) such that...
AbstractLet G=(V,E) be a simple graph. A subset S of V is a dominating set of G if for any vertex v∈...
The domination number γG of a nonempty graph G is the minimum cardinality among all subsets D⊆VG suc...
20 pages, 12 figuresA set $S\subseteq V(G)$ of a graph $G$ is a dominating set if each vertex has a ...
AbstractThe bondage number b(G) of a nonempty graph G is the cardinality of a smallest set of edges ...
AbstractThe bondage number b(G) of a nonempty graph G is defined to be the cardinality of the smalle...
AbstractThe bondage number b(G) of a nonempty graph G is the cardinality of a smallest edge set whos...
AbstractA set D of vertices in a graph G is a dominating set if each vertex of G that is not in D is...
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 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...
AbstractThe bondage number b(G) of a graph G is the minimum cardinality of a set of edges of G whose...
The domination number γ(G) of a graph G is the minimum number of vertices in a set D such that every...
<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 nonempty graph G is defined to be the cardinality of the smalle...
Let G(V(G), E(G)) be a simple undirected graph. A dominating set of G is a subset D ? V(G) such that...
AbstractLet G=(V,E) be a simple graph. A subset S of V is a dominating set of G if for any vertex v∈...
The domination number γG of a nonempty graph G is the minimum cardinality among all subsets D⊆VG suc...
20 pages, 12 figuresA set $S\subseteq V(G)$ of a graph $G$ is a dominating set if each vertex has a ...
DOI
Add to ORKG