On augmented eccentric connectivity index of graphs and trees
classification
🧮 math.CO
keywords
graphsaugmentedconnectivityeccentricindextreesextremalconnected
read the original abstract
In this paper we establish all extremal graphs with respect to augmented eccentric connectivity index among all (simple connected) graphs, among trees and among trees with perfect matching. For graphs that turn out to be extremal explicit formulas for the value of augmented eccentric connectivity index are derived.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.