Eccentric Connectivity Polynomial [ECP] of Banana Tree Generator B(n,k)
Abstract
The Eccentric connectivity index of a graph G can be defined as where refers to the degree of vertex in and is the eccentricity of is the distance to a farthest vertex from and is denoted by . Eccentric connectivity polynomial [ECP] is a another version from Eccentric connectivity index and is defined as In this article, we are discussing about Eccentric connectivity polynomial [ECP] of Banana tree generator and Modified Banana tree