Back to Search
Start Over
Hyper-Wiener indices of polyphenyl chains and polyphenyl spiders
- Source :
- Open Mathematics, Vol 17, Iss 1, Pp 668-676 (2019)
- Publication Year :
- 2019
- Publisher :
- De Gruyter, 2019.
-
Abstract
- Let G be a connected graph and u and v two vertices of G. The hyper-Wiener index of graph G is WW(G)=12∑u,v∈V(G)(dG(u,v)+dG2(u,v))$\begin{array}{} WW(G)=\frac{1}{2}\sum\limits_{u,v\in V(G)}(d_{G}(u,v)+d^{2}_{G}(u,v)) \end{array}$, where dG(u, v) is the distance between u and v. In this paper, we first give the recurrence formulae for computing the hyper-Wiener indices of polyphenyl chains and polyphenyl spiders. We then obtain the sharp upper and lower bounds for the hyper-Wiener index among polyphenyl chains and polyphenyl spiders, respectively. Moreover, the corresponding extremal graphs are determined.
Details
- Language :
- English
- ISSN :
- 23915455
- Volume :
- 17
- Issue :
- 1
- Database :
- Directory of Open Access Journals
- Journal :
- Open Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- edsdoj.fe6888f08fe46f292361fe2373a5fa6
- Document Type :
- article
- Full Text :
- https://doi.org/10.1515/math-2019-0053