✦ LIBER ✦

Restrained bondage number of a graph

✍ Scribed by Kala, R.; Vasantha, T. R. Nirmala

Book ID: 120608783
Publisher: Informa UK (Taylor & Francis)
Year: 2009
Tongue: English
Weight: 197 KB
Volume: 12
Category: Article
ISSN: 0972-0529
DOI: 10.1080/09720529.2009.10698243

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Restrained bondage in graphs

✍ Johannes H. Hattingh; Andrew R. Plummer 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 270 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

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).

Split bondage numbers of a graph

✍ Kulli, V. R.; Janakiram, B.; Iyer, Radha R. 📂 Article 📅 1998 🏛 Informa UK (Taylor & Francis) 🌐 English ⚖ 248 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

New results about the bondage number of

New results about the bondage number of a graph

✍ Ulrich Teschner 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 502 KB