Abstract
Computing Degree-Based Topological Indices of Jahangir Graph
Highlights
The study of topological indices, based on distance in a graph, was effectively employed in 1947, in chemistry by Weiner [1]
A graph G is an ordered pair (V, E), where V is the set of vertices and E is the set of edges
A graph is said to be connected if there is a path between any two of its vertices
Summary
The study of topological indices, based on distance in a graph, was effectively employed in 1947, in chemistry by Weiner [1]. 1. Introduction The study of topological indices, based on distance in a graph, was effectively employed in 1947, in chemistry by Weiner [1]. He introduced a distance-based topological index called the Wiener index to correlate properties of alkenes and the structures of their molecular graphs. Topological indices play a vital role in computational and theoretical aspects of chemistry in predicting material properties [2, 3, 4, 5, 6, 7, 8]. A graph G is an ordered pair (V, E), where V is the set of vertices and E is the set of edges.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
