Abstract:

A graph G is said to be cyclic if it contains a cycle. A cycle generated by S\subseteq V(G), which carries the adjacency property in G, is an induced cycle of G. In this study, we establish the explicit form of the polynomial representation of the number of cycles in the edge corona of two cyclic graphs.