Abstract
Graph constructing algorithms and their mapping with real life problems for scientific data analysis are getting popular. Standard algorithms construct the graph in a way that it can deal with all possibilities of input data to calculate the desired output. This article gives an algorithmic computational model for edge based eccentric topological indices by constructing zero divisor graph containing finite rings as Z(p1p2) x Z(q) and Z(p2) x Z(q), where p, p(1), p(2) and q are primes numbers. At first algorithm classify vertices with common eccentricity and then computes first Zagreb, third Zagreb, geometric-arithmetic, atom-bond connectivity and harmonic index for zero divisor graphs containing commutative rings. Results of algorithms are verified using mathematical formulation so algorithm can be reuse or modify for applications of coding theory, algebraic cryptography, ICT, biology and chemistry easily.