𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The independence number of the strong product of cycles

✍ Scribed by A. Vesel

Book ID
104353356
Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
779 KB
Volume
36
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

✦ Synopsis

We describe algorithms to search independent vertex sets in strong products of odd cycles. The algorithms enable determination of the independence number of two infinite families of graphs: C5 [] C7 [] C2k+i and C5 [] C9 [] C2k+i. We also present exact values or improved bounds on the size of a largest independent set for several other strong products of odd cycles. Applications to the chromatic number of strong products of odd cycles and to the Shannon capacity of C~, conclude the paper.

πŸ“œ SIMILAR VOLUMES

The independence number of the strong pr
The independence number of the strong product of odd cycles
✍ Aleksander Vesel; Janez Ẑerovnik πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 209 KB

The independence number of the strong product C5~]C7[]C7 determined by the NISPOC software package is presented. Better lower bounds on the independence numbers for two infinite families of strong products of three odd cycles are given.

The Menger number of the strong product
The Menger number of the strong product of graphs
✍ Abajo, E.; Casablanca, R.M.; DiΓ‘nez, A.; GarcΓ­a-VΓ‘zquez, P. πŸ“‚ Article πŸ“… 2013 πŸ› Elsevier Science 🌐 English βš– 378 KB