𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the reliability of a number of s-p reducible graphs

✍ Scribed by Sophocles L. Katsademas; Zohel S. Khalil


Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
370 KB
Volume
27
Category
Article
ISSN
0026-2714

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


On the number of P-vertices of some grap
✍ Milica AndeliΔ‡; C.M. da Fonseca; Ricardo Mamede πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 185 KB
On the geodetic number of a graph
✍ Gary Chartrand; Frank Harary; Ping Zhang πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 308 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 Cop Number of a Graph
✍ A. Berarducci; B. Intrigila πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 608 KB