Dendrimer Graphs as Thorn Graphs and Their Topological Edge Properties

Abstract

Let G be a connected n-vertex graph with the vertex set V(G) = {v ₁, v ₂, …, v _n } and let P = (p ₁, p ₂, …, p _n ) be an n-tuple of nonnegative integers. The thorn graph G _P is the graph obtained by attaching p _i new vertices of degree one to the vertex v _i of G, for i = 1, 2, …, n. In this paper, relations between the edge-Wiener indices of G and G _P have been established and several special cases of these results have been examined. Results are applied to obtain closed formulas for the terminal Wiener index, the first and the second edge-Wiener indices of an infinite family of dendrimers by considering them as thorn graphs of simpler dendrimers.

http://ift.tt/2cULZy7