Abstract

Fereshteh Momen, Mehdi Alaeiyan^*

DOI : http://dx.doi.org/10.13005/ojc/310237

Let  be a simple connected graph with vertex and edge sets V(G) and E(G),  respectively. The degree distance of G  is defined as where deg(u)    is  the  degree  of u   and D(u) = Σ_vεv d(u,v) is the sum of all distances  from  the  vertex  . The  reverse  degree  distance is a connected graph   invariant   closely  related  to  the  degree  distance  proposed  in  the mathematical chemistry and it is defined as, DD(G) = 2q (p-1) Diam(G) - DD(G), Where p,q Diam(G) are  the  number of vertices, the number of edges and diameter of G, respectively. In this  paper  we comput the degree distance and reverse degree distance of one tetragonal carbon nanocones.

Carbon nanocones; degree distance; reverse degree distance; topological index

[ View HTML Full Text]