Degree Distance and Reverse Degree Distance of one Tetragonal Carbon Nanocones

摘要

Let G = (V(G), E (G)) be a simple connected graph with vertex and edge sets V(G) and E (G),respectively. The degree distance of G is defined as DD(G)=Σto u∈V(G)_(deg(u)D(u),where deg (u) is the degree of u and ~D(u)= Σ to v∈V(G)_(d(u,v)) the sum of all distances from the vertex u.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, rDD (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.