On the lower and upper bounds for different indices of tricyclic graphs
| Autor: | Lijie Zhu, Shang-wang Tan, Dong-fang Wang |
|---|---|
| Rok vydání: | 2015 |
| Předmět: |
Vertex (graph theory)
Discrete mathematics Applied Mathematics 010102 general mathematics 0102 computer and information sciences Wiener index 01 natural sciences Upper and lower bounds Combinatorics Computational Mathematics Mathematics::Probability Computer Science::Discrete Mathematics 010201 computation theory & mathematics 0101 mathematics Connectivity Mathematics |
| Zdroj: | Journal of Applied Mathematics and Computing. 51:1-11 |
| ISSN: | 1865-2085 1598-5865 |
| DOI: | 10.1007/s12190-015-0887-5 |
| Popis: | The Wiener index of a connected graph $$G$$ is equal to the sum of distances between all vertex pairs, one of its extensions is the hyper-Wiener index. The Harary index is defined as the sum of reciprocals of distances between all vertex pairs in $$G.$$ In this paper, the smallest and largest Wiener and hyper-Wiener indices, sharp upper bound for the Harary index among tricyclic graphs are determined. The corresponding extremal graphs are completely characterized, too. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink