Eccentric Connectivity Polynomial [ECP] of Banana Tree Generator B(n,k)

  • Prashanth K K, Rajeshwari M, Yogesh V, Uma S
Keywords: Eccentric connectivity index, Eccentric connectivity polynomial, Banana tree generator graph.

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

Published
2021-11-02
How to Cite
Yogesh V, Uma S, P. K. K. R. M. (2021). Eccentric Connectivity Polynomial [ECP] of Banana Tree Generator B(n,k). Design Engineering, 9312-9321. Retrieved from http://thedesignengineering.com/index.php/DE/article/view/5974
Section
Articles