✦ LIBER ✦

New results about the bondage number of a graph

✍ Scribed by Ulrich Teschner

Book ID: 108316039
Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 502 KB
Volume: 171
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(96)00007-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The bondage number of a graph

✍ John Frederick Fink; Michael S. Jacobson; Lael F. Kinch; John Roberts 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 654 KB

On the bondage number of a graph

✍ Yue-Li Wang 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 162 KB

The bondage number b(G) of a graph G is the minimum cardinality of a set of edges of G whose removal from G makes the domination number of G increase. There are several papers discussed the upper bound of b(G). In this paper, we shall give an improved upper bound of b(G).

Some results about the interval number o

Some results about the interval number of a graph

✍ Christoph Maas 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 213 KB

Bounds on the bondage number of a graph

✍ Bert L. Hartnell; Douglas F. Rall 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 317 KB

The 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 bond

On the Roman Bondage Number of Planar Gr

On the Roman Bondage Number of Planar Graphs

✍ Nader Jafari Rad; Lutz Volkmann 📂 Article 📅 2010 🏛 Springer Japan 🌐 English ⚖ 143 KB

A counterexample to a conjecture on the

A counterexample to a conjecture on the bondage number of a graph

✍ Ulrich Teschner 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 113 KB

The bondage number h(G) of a nonempty graph G was first introduced by Fink, Jacobson, Kinch and Roberts in [3]. They generalized a former approach to domination-critical graphs, In their publication they conjectured that b(G)<d(G)+ 1 for any nonempty graph G.