Minimum Eccentric Connectivity Index for Graphs with Fixed Order and Fixed Number of Pending Vertices
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2018
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913257282863104 |
|---|---|
| author | Devillez, Gauvain Hertz, Alain Mélot, Hadrien Hauweele, Pierre |
| author_facet | Devillez, Gauvain Hertz, Alain Mélot, Hadrien Hauweele, Pierre |
| contents | The eccentric connectivity index of a connected graph $G$ is the sum over all vertices $v$ of the product $d_{G}(v) e_{G}(v)$, where $d_{G}(v)$ is the degree of $v$ in $G$ and $e_{G}(v)$ is the maximum distance between $v$ and any other vertex of $G$. This index is helpful for the prediction of biological activities of diverse nature, a molecule being modeled as a graph where atoms are represented by vertices and chemical bonds by edges. We characterize those graphs which have the smallest eccentric connectivity index among all connected graphs of a given order $n$. Also, given two integers $n$ and $p$ with $p\leq n-1$, we characterize those graphs which have the smallest eccentric connectivity index among all connected graphs of order $n$ with $p$ pending vertices. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1809_03158 |
| institution | arXiv |
| publishDate | 2018 |
| record_format | arxiv |
| spellingShingle | Minimum Eccentric Connectivity Index for Graphs with Fixed Order and Fixed Number of Pending Vertices Devillez, Gauvain Hertz, Alain Mélot, Hadrien Hauweele, Pierre Discrete Mathematics Combinatorics The eccentric connectivity index of a connected graph $G$ is the sum over all vertices $v$ of the product $d_{G}(v) e_{G}(v)$, where $d_{G}(v)$ is the degree of $v$ in $G$ and $e_{G}(v)$ is the maximum distance between $v$ and any other vertex of $G$. This index is helpful for the prediction of biological activities of diverse nature, a molecule being modeled as a graph where atoms are represented by vertices and chemical bonds by edges. We characterize those graphs which have the smallest eccentric connectivity index among all connected graphs of a given order $n$. Also, given two integers $n$ and $p$ with $p\leq n-1$, we characterize those graphs which have the smallest eccentric connectivity index among all connected graphs of order $n$ with $p$ pending vertices. |
| title | Minimum Eccentric Connectivity Index for Graphs with Fixed Order and Fixed Number of Pending Vertices |
| topic | Discrete Mathematics Combinatorics |
| url | https://arxiv.org/abs/1809.03158 |