Abstract
Abstract 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 $\begin{array}{} \displaystyle O_n^m \end{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).
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.