Finding the Number of Cycle Egamorphisms

Paichayon Sirisathianwatthana, Nirutt Pipattanajinda

Abstract

A mapping f from graph G to graph H is called an egamorphism (or weak homomorphism, contraction) from G to H, if f preserves or contracts the edges. This paper is to find the number of egamorphism from Cm to Cn, where m, n ∈ Z+ and m, n > 2.