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).
✦ LIBER ✦
On the bondage number of middle graphs
✍ Scribed by A. Aytaç, T. Turaci, Z. N. Odabaş
- Book ID
- 120748100
- Publisher
- SP MAIK Nauka/Interperiodica
- Year
- 2013
- Tongue
- English
- Weight
- 527 KB
- Volume
- 93
- Category
- Article
- ISSN
- 0001-4346
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
On the bondage number of a graph
✍
Yue-Li Wang
📂
Article
📅
1996
🏛
Elsevier Science
🌐
English
⚖ 162 KB
On the Roman Bondage Number of Planar Gr
✍
Nader Jafari Rad; Lutz Volkmann
📂
Article
📅
2010
🏛
Springer Japan
🌐
English
⚖ 143 KB
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
✍
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 bondage number of planar and dire
✍
Kelli Carlson; Mike Develin
📂
Article
📅
2006
🏛
Elsevier Science
🌐
English
⚖ 185 KB
The total bondage number of grid graphs
✍
Fu-Tao Hu; You Lu; Jun-Ming Xu
📂
Article
📅
2012
🏛
Elsevier Science
🌐
English
⚖ 364 KB