Extremal Trees for the Exponential of Forgotten Topological Index

Abstract

Let F be the forgotten topological index of a graph G. The exponential of the forgotten topological index is defined as eFG=∑x,y∈Stx,yGex2+y2, where tx,yG is the number of edges joining vertices of degree x and y. Let Tn be the set of trees with n vertices; then, in this paper, we will show that the path Pn has the minimum value for eF over Tn.