𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On bounds for the cutting number of a graph

✍ Scribed by Simon Mukwembi…

Book ID
120717127
Publisher
Indian National Science Academy
Year
2012
Tongue
English
Weight
118 KB
Volume
43
Category
Article
ISSN
0019-5588

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bounds on the -domination number of a gr
Bounds on the -domination number of a graph
✍ Ermelinda DeLaViña; Wayne Goddard; Michael A. Henning; Ryan Pepper; Emil R. Vaug 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 200 KB

The k-domination number of a graph is the cardinality of a smallest set of vertices such that every vertex not in the set is adjacent to at least k vertices of the set. We prove two bounds on the k-domination number of a graph, inspired by two conjectures of the computer program Graffiti.pc. In part

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