Eccentricity based graph parameters of subdivision-vertex-vertex (edge-edge) join products

Effective utilization of graph products are essential for the development of complex networking systems. The graph product can produce a diverse array of fundamental graphs as an application. A topological index, often referred to as a graph parameter, is an expression that allocates a numerical value to a particular chemical structure, proving beneficial for predictive modeling. Lu et al. [1] constructed two new variations of join (sum) graphs and examined the adjacency, Laplacian, and signless Laplacian characteristic polynomials of these variants. In this article, we discussed and investigated some distance and degree based topological properties of these two variations, known as subdivision-vertex-vertex join (SVVJ) and subdivision-edge-edge join (SEEJ) graphs. Moreover, we computed the total eccentricity, eccentric connectivity, connective eccentric and three versions of eccentricity based Zagreb indices.