✦ LIBER ✦
Computing graph invariants on rotagraphs using dynamic algorithm approach: the case of (2,1)-colorings and independence numbers
✍ Scribed by Sandi Klavžar; Aleksander Vesel
- Book ID
- 104294151
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 571 KB
- Volume
- 129
- Category
- Article
- ISSN
- 0166-218X
No coin nor oath required. For personal study only.
✦ Synopsis
Rotagraphs generalize all standard products of graphs in which one factor is a cycle. A computer-based approach for searching graph invariants on rotagraphs is proposed and two of its applications are presented. First, the -numbers of the Cartesian product of a cycle and a path are computed, where the -number of a graph G is the minimum number of colors needed in a (2; 1)-coloring of G. The independence numbers of the family of the strong product graphs C7 C7 C 2k+1 are also obtained.