𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the bondage number of planar and directed graphs

✍ Scribed by Kelli Carlson; Mike Develin

Book ID
108113645
Publisher
Elsevier Science
Year
2006
Tongue
English
Weight
185 KB
Volume
306
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the bondage number of a graph
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).

The bondage number of a graph
The bondage number of a graph
✍ John Frederick Fink; Michael S. Jacobson; Lael F. Kinch; John Roberts πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 654 KB
Bounds on the bondage number of a graph
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