Abstract
Let n, m and a(1), . . . , a(m) be positive integers, 1 <= a(i) <= [n/2] and a(i) not equal a(j) for all 1 <= i < j <= m. An undirected graph with the set of vertices V = { upsilon(1), . . . , upsilon(n)} and the set of edges E = {upsilon(i) upsilon(i) (+ aj) : 1 <= i <= n, 1 <= j <= m}, the indices being taken modulo n, is called a circulant graph and it is denotes by C-n (a(1) , . . . , a(m)). The numbers a(1) , . . . , a(m) are called the generators and we say that the edge upsilon(i) upsilon(i) (+ aj), is of type a(j).
It is easy to se that the circulant graph C-n (a(1) , . . . , a(m)) is a regular graph of degree r, where
r = {2m-1 if n/2 is an element of{a(1) , . . . , a(m)} 2m otherwise.
In this paper, we determine that the circulant graphs are 3-total edge product cordial.