๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A lower bound for the CO-irredundance number of a graph

โœ Scribed by S. Finbow

Book ID
108113521
Publisher
Elsevier Science
Year
2005
Tongue
English
Weight
215 KB
Volume
295
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A lower bound for irredundant Ramsey num
A lower bound for irredundant Ramsey numbers
โœ Michael Krivelevich ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 348 KB

Given a graph G-(V,E), a vertex subset U C V is called irredundant if every vertex v E U either has no neighbours in U or there exists a vertex w E V\U such that v is the only neighbour of w in U. The irredundant Ramsey number s(m,n) is the smallest N such that any redblue edge colouring of K N yiel

The irredundance number and maximum degr
The irredundance number and maximum degree of a graph
โœ B. Bollobรกs; E.J. Cockayne ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 104 KB

A vertex x in a subset X of vertices of an undirected graph is redundant if its dosed neighborhood is contained in the union of closed neighborhoods of vertices of X-{x}. In the context of a communications network, this means that any vertex that may receive communications from X may also be irdorme

A lower bound on the independence number
A lower bound on the independence number of a graph
โœ Jochen Harant ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 210 KB

A new lower bound on the independence number of a graph is established and an accompanying efficient algorithm constructing an independent vertex set the cardinality of which is at least this lower bound is given. (~