✦ LIBER ✦

A Note on the Roman Bondage Number of Planar Graphs

✍ Scribed by Akbari, Saieed; Khatirinejad, Mahdad; Qajar, Sahar

Book ID: 120636843
Publisher: Springer Japan
Year: 2012
Tongue: English
Weight: 175 KB
Volume: 29
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-011-1129-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

On the bondage number of planar and dire

On the bondage number of planar and directed graphs

✍ Kelli Carlson; Mike Develin 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 185 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).

On the bondage number of middle graphs

✍ A. Aytaç, T. Turaci, Z. N. Odabaş 📂 Article 📅 2013 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 527 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