1 / 5

DISTANCE BASED TOPOLOGICAL INDICES OF CATERPILLAR TREE GRAPH

DISTANCE BASED TOPOLOGICAL INDICES OF CATERPILLAR TREE GRAPH.

pgarrett
Download Presentation

DISTANCE BASED TOPOLOGICAL INDICES OF CATERPILLAR TREE GRAPH

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. DISTANCE BASED TOPOLOGICAL INDICES OF CATERPILLAR TREE GRAPH

  2. In graphtheory, a caterpillarorcaterpillartreeis a tree in whichallthevertices are withindistance 1 of a central path. Fortwovertices u &v n a graph G, thedistancefrom u to v isdenotedby d (u, v) & defined as thelengthof a shortest u-v path in graph G.

  3. Topological graph indices are widely used in mathematical chemistry to predict properties of chemical compounds. They have been intensively studied in recent years. Dozens of various indices were suggested to describe topology of complex molecules, among the earliest and the most famous being the first and the second Zagreb indices – M1 and M2 respectively.

  4. Many different topological indices have been investigated so far. Most of the useful topological indices are distance based or degree based. The Wiener index, the Harary index and the total eccentricity index are examples ofdistance based topological indices and the Zagreb indices and Randic index are examples of degree based topological indices.

  5. The popular research problem is to find the degree topological indices of the caterpillar tree graph, Depending on the degree sum of the vertices of a graph G and Z2(G) = and Followed by the rst Zagreb index, Furtula and Gutman introduced forgotten topological index (also called F-index) which was denfined as Z3(G) =

More Related