Computation of eccentricity associated topological descriptors through Python for comb tree

Abstract

Abstract Topological manifestation of a graph G is a numerical value which reveals it’s topological properties. The eccentricity of one node u ∈ V (G)(that is eG(u)), is the greatest distance between u and also any other vertex of G. The degree of a In this paper, we are using Python program to compute eccentricity related Topological indices for Comb tree with any number of vertices, relation between descriptors and the bounds for indices also.