𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Bounds on the -spread of a graph

✍ Scribed by Carla Silva Oliveira; Leonardo Silva de Lima; Nair Maria Maia de Abreu; Steve Kirkland

Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
201 KB
Volume
432
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

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 average connectivity of a
Bounds on the average connectivity of a graph
✍ Peter Dankelmann; Ortrud R. Oellermann πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 235 KB

In this paper, we consider the concept of the average connectivity of a graph, deΓΏned to be the average, over all pairs of vertices, of the maximum number of internally disjoint paths connecting these vertices. We establish sharp bounds for this parameter in terms of the average degree and improve o