Study of θϕ Networks via Zagreb Connection Indices

Graph theory can be used to optimize interconnection network systems. The compatibility of such networks mainly depends on their topology. Topological indices may characterize the topology of such networks. In this work, we studied a symmetric network θϕ formed by ϕ time repetition of the process of joining θ copies of a selected graph Ω in such a way that corresponding vertices of Ω in all the copies are joined with each other by a new edge. The symmetry of θϕ is ensured by the involvement of complete graph Kθ in the construction process. The free hand to choose an initial graph Ω and formation of chemical graphs using θϕΩ enhance its importance as a family of graphs which covers all the pre-defined graphs, along with space for new graphs, possibly formed in this way. We used Zagreb connection indices for the characterization of θϕΩ. These indices have gained worth in the field of chemical graph theory in very small duration due to their predictive power for enthalpy, entropy, and acentric factor. These computations are mathematically novel and assist in topological characterization of θϕΩ to enable its emerging use.