The independence number of the strong pr
✍
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