A Study on Degree Based Topological Indices of Harary Subdivision Graphs With Application

Combinatorial design theory and graph decompositions play a critical role in the exploration of combinatorial design theory and are essential in mathematical sciences. The process of graph decomposition involves partitioning the set of edges in a graph G. An n-sun graph, characterized by a cycle with an edge connecting each vertex to a terminating vertex of degree one, is introduced in this study. The concept of n-sun decomposition is applied to certain even-order graphs. The indices covered in this study include the general connectivity index of the harary graphs, Zagreb indices, symmetric division degree indices and randic indices.