<abstract xmlns="http://www.w3.org/1999/xhtml">The eccentricity <italic>εu</italic> of vertex <italic>u</italic> in a connected graph <italic>G</italic>, is the distance between <italic>u</italic> and a vertex farthermost from <italic>u</italic>. 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
<inline-formula><alternatives><math xmlns:mml="http://www.w3.org/1998/Math/MathML"><mtable><mtr><mtd><mstyle><msubsup><mi>O</mi><mi>n</mi><mi>m</mi></msubsup></mstyle></mtd></mtr></mtable></math><tex-math>$\begin{array}{}
\displaystyle
O_n^m
\end{array}$</tex-math></alternatives></inline-formula>
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 <italic>ECP</italic>(<italic>G</italic>, <italic>x</italic>).</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
Onm$\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).

New and Modified Eccentric Indices of Octagonal Grid <italic>Omn</italic>

Departamento de Matemática Aplicada y Estadística

Universidad Politécnica de Cartagena, Hospital de Marina

Applied Mathematics and Nonlinear Sciences

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

New and Modified Eccentric Indices of Octagonal Grid 

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 and Modified Eccentric Indices of Octagonal Grid O^m_n

Publicado en línea: 03 oct 2018

Páginas: 209 - 228

Recibido: 19 abr 2018

Aceptado: 26 may 2018

DOI: https://doi.org/10.21042/AMNS.2018.1.00016

Palabras clave
Degree, Eccentricity, Ediz eccentric connectivity index, modified eccentric connectivity index, modified eccentric connectivity polynomial (, ), octagonal grid

© 2018 M. Naeem et al., published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

New and Modified Eccentric Indices of Octagonal Grid Omn

Publicado en línea: 03 oct 2018

Páginas: 209 - 228

Recibido: 19 abr 2018

Aceptado: 26 may 2018

DOI: https://doi.org/10.21042/AMNS.2018.1.00016

Palabras claveDegree, Eccentricity, Ediz eccentric connectivity index, modified eccentric connectivity index, modified eccentric connectivity polynomial (, ), octagonal grid

© 2018 M. Naeem et al., published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

New and Modified Eccentric Indices of Octagonal Grid O^m_n

Palabras clave
Degree, Eccentricity, Ediz eccentric connectivity index, modified eccentric connectivity index, modified eccentric connectivity polynomial (, ), octagonal grid