Answers are grounded in this paper and cite their sources.
The eccentricity ε u of vertex u in a connected graph G , is the distance between u and a vertex farthermost from u . The aim of the present paper is to introduce new eccentricity based index and eccentricity based polynomial, namely modified augmented eccentric connectivity index and modified augmented eccentric connectivity polynomial respectively. As an application we compute these new indices for octagonal grid O n m array Oₙᵐ array and we compare the results obtained with the ones obtained by other indices like Ediz eccentric connectivity index, modified eccentric connectivity index and modified eccentric connectivity polynomial ECP ( G , x ).
No takes yet. Share an insight, caveat, or question.
Naeem et al. (2018) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: