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

On the independence number of the strong product of cycle-powers

โœ Scribed by Sevak H. Badalyan; Stepan E. Markosyan

Book ID
119227554
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
202 KB
Volume
313
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The independence number of the strong pr
The independence number of the strong product of cycles
โœ A. Vesel ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 779 KB

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 larg

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.

On the theta number of powers of cycle g
On the theta number of powers of cycle graphs
โœ Christine Bachoc, Arnaud Pรชcher, Alain Thiรฉry ๐Ÿ“‚ Article ๐Ÿ“… 2013 ๐Ÿ› Springer-Verlag ๐ŸŒ English โš– 241 KB
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