GREEDY CYCLES IN THE STAR GRAPHS
We apply the greedy approach to construct greedy cycles in Star graphs S„,n A 3, defined as Cayley graphs on the symmetric group Sym<sub>n</sub> with generating set t = {(1 i), 2 A i A n} of transpositions. We define greedy sequences presented by distinct elements from t, and prove that any greedy sequence of length k, 2 A ? A n - 1, forms a greedy cycle of length 2 • 3<sup>fc-1</sup>. Based on these greedy sequences we give a construction of a maximal set of independent greedy cycles in the Star graphs S<sub>n</sub> for any n A 3.