Construction of Circular Distant Divisor Graphs

Let H be a graph with n vertices and e edges. A circular path
P between two distant vertices is called a circular distant divisor path, if circular length of P divides e, the number of edges in the graph. We can construct a new graph from H consisting of the vertex set same as that of H and two vertices are adjacent if they have a circular distant divisor path in H. This new graph is called circular distant divisor graph of H and is denoted by CD H.
In this article, constructions have been done, regarding circular distant divisor graphs of some standard graphs such
as path, cycle, star, wheel, complete and complete bipartite graphs. Moreover, family of corona graphs was studied.
When this circular distant divisor graphs concept was applied to the corona graphs, it was observed that sometimes
the new graph was also a corona graph and sometimes it was not a corona graph.