Order Structured Graphs of Cyclic Groups and their Classification

Let ^o (G) with G C₏, a cyclic group of order p, be an order structured graph. The group C₏ will be assumed as the vertex set of the graph ^o (G) and an edge between vertices will be built on the basis of a defined relation via order structure. Certain graphical parameters such as independence ratio, clique number, domination number, and separability are discussed. Some characterizations are proposed and proved by incorporating the defined relation. It is further proved that ^o (C₏) can never be a hamiltonian graph. Lastly, It is shown that C (^o (C₏) ) is isomorphic to ^o (C₏).