Open AccessComputation of eccentricity associated topological descriptors through Python for comb tree
Author(s) -
S. Manimekalai,
U. Mary
Publication year - 2020
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1597/1/012019
Subject(s) - python (programming language) , topology (electrical circuits) , mathematics , computation , vertex (graph theory) , combinatorics , topological index , graph , discrete mathematics , computer science , algorithm , operating system
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 e G (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.