CYCLIC GRAPH - EDGE PRODUCT NUMBER
J. P. Thavamani, D. Ramesh · 2012
A graph G is said to be an edge product graph if there exists an edge function f: E → P such that the function f and its corresponding edge product function F on V satisfies that F(v) P for every v V and if e1, e2, …,ep E such that f(e1). f(e2). …. f(ep) P then the edges e1, e2, …,ep are incident on a vertex. In this paper, for a given cyclic graph G(V, E), the edge product number of cycles is found.