𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Upper bounds on the independence and the clique covering number

✍ Scribed by Cyriel Van Nuffelen; Kristel Van Rompay

Publisher
Springer
Year
2003
Tongue
English
Weight
82 KB
Volume
1
Category
Article
ISSN
1619-4500

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An Upper Bound for the Independent Domin
An Upper Bound for the Independent Domination Number
✍ Liang Sun; Jianfang Wang πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 87 KB

Let G be a simple graph of order n and minimum degree $. The independent domination number i(G) is defined to be the minimum cardinality among all maximal independent sets of vertices of G. In this paper, we show that i(G) n+2$&2 -n$. Thus a conjecture of Favaron is settled in the affirmative.

Upper bounds on the general covering num
Upper bounds on the general covering number CΞ»(v, k, t, m)
✍ Riccardo Bertolo; Iliya Bluskov; Heikki HΓ€mΓ€lΓ€inen πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 166 KB

## Abstract A collection $\cal C$ of __k__‐subsets (called __blocks__) of a __v__‐set __X__ (__v__) = {1, 2,…, __v__} (with elements called __points__) is called a __t__‐(__v__, __k__, __m__, Ξ») __covering__ if for every __m__‐subset M of __X__ (__v__) there is a subcollection $\cal K$ of $\cal C$