“…Classes of graphs that are circulant include the, antiprism graphs, crown graphs, cocktail party graphs, rook graphs, complete bipartite graphs, Andrásfai graphs, empty graphs, complete graphs, Paley graphs of prime order, Möbius ladders, torus grid graphs, and prism graphs. Because of this somewhat universality, circulant graphs have been the subject of much investigation; for example, the chromatic index, Connectivity, Wiener index, domination number, revised Szeged spectrum, Multi-level and antipodal labeling, M polynomial and many degree-based topological indices for circulant graphs are studied (Voigt and Walther, 1991;Boesch, and Tindell, 1984;Zhou, 2014;Xueliang et al, 2011;Habibi and Ashrafi, 2014;Kang et al, 2016;Nazeer et al, 2015;Munir et al, 2016). For details on topological indices readers are refered to Sardar et al (2017) and Rehman et al (2017).…”