Eccentric Connectivity Index of Chemical Trees

Abstract

The eccentric connectivity index ${\xi }^c$ is a distance--based molecular structure descriptor that was recently used for mathematical modeling of biological activities of diverse nature. We prove that the broom has maximum ${\xi }^c$ among trees with a fixed maximum vertex degree, and characterize such trees with minimum ${\xi }^c$\,. In addition, we propose a simple linear algorithm for calculating ${\xi }^c$ of trees.

14 pages, 2 figures

References in corpus (2)

• On eccentric connectivity index
• On the Wiener index and Laplacian coefficients of graphs with given diameter or radius

Cited by in corpus (7)

• Eccentric connectivity index
• On the extremal total reciprocal edge-eccentricity of trees
• On augmented eccentric connectivity index of graphs and trees
• Comparison of Wiener index and Zagreb eccentricity indices
• On the extremal properties of the average eccentricity
• On the maximum CEI of graphs with paprameters
• Extremal values on the eccentric distance sum of trees