Skip to main content
SpringerLink
Log in

Bounding the \(k\)-Steiner Wiener and Wiener-Type Indices of Trees in Terms of Eccentric Sequence

  • Published:
Acta Applicandae Mathematicae Aims and scope Submit manuscript

Abstract

The eccentric sequence of a connected graph \(G\) is the nondecreasing sequence of the eccentricities of its vertices. The Wiener index of \(G\) is the sum of the distances between all unordered pairs of vertices of \(G\). The unique trees that minimise the Wiener index among all trees with a given eccentric sequence were recently determined by the present authors. In this paper we show that these results hold not only for the Wiener index, but for a large class of distance-based topological indices which we term Wiener-type indices. Particular cases of this class include the hyper-Wiener index, the Harary index, the generalised Wiener index \(W^{\lambda }\) for \(\lambda >0\) and \(\lambda <0\), and the reciprocal complementary Wiener index. Our results imply and unify known bounds on these Wiener-type indices for trees of given order and diameter.

We also present similar results for the \(k\)-Steiner Wiener index of trees with a given eccentric sequence. The Steiner distance of a set \(A\subseteq V(G)\) is the minimum number of edges in a subtree of \(G\) whose vertex set contains \(A\), and the \(k\)-Steiner Wiener index is the sum of distances of all \(k\)-element subsets of \(V(G)\). As a corollary, we obtain a sharp lower bound on the \(k\)-Steiner Wiener index of trees with given order and diameter, and determine in which cases the extremal tree is unique, thereby correcting an error in the literature.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2

Similar content being viewed by others

References

  1. Cai, X., Zhou, B.: Reciprocal complementary Wiener numbers of trees, unicyclic graphs and bicyclic graphs. Discrete Appl. Math. 157(14), 3046–3054 (2009)

    Article  MathSciNet  Google Scholar 

  2. Cambie, S.: The asymptotic resolution of a problem of Plesník (2018). Preprint. arXiv:1811.08334

  3. Cambie, S.: Extremal total distance of graphs of given radius (2019). Preprint. arXiv:1903.01358

  4. Chartrand, G., Oellermann, O.R., Tian, S.L., Zou, H.B.: Steiner distance in graphs. Čas. Pěst. Mat. 114(4), 399–410 (1989)

    Article  MathSciNet  Google Scholar 

  5. Chen, Y., Wu, B., An, X.: Wiener index of graphs with radius two. Int. Sch. Res. Not. 2013, 906756 (2013), 5 pp.

    MATH  Google Scholar 

  6. Dankelmann, P.: The Steiner \(k\)-Wiener index of graphs with given minimum degree. Discrete Appl. Math. 268, 35–43 (2019)

    Article  MathSciNet  Google Scholar 

  7. Dankelmann, P., Dossou-Olory, A.A.V.: Wiener index, number of subtrees, and tree eccentric sequence. MATCH Commun. Math. Comput. Chem. 84, 611–628 (2020)

    Google Scholar 

  8. Dankelmann, P., Dossou-Olory, A.A.V.: On trees with a given eccentric sequence (2020). Manuscript

  9. Dankelmann, P., Oellermann, O.R., Swart, H.C.: The average Steiner distance of a graph. J. Graph Theory 22(1), 15–22 (1996)

    Article  MathSciNet  Google Scholar 

  10. Dankelmann, P., Swart, H.C., Oellermann, O.R.: On the average Steiner distance of graphs with prescribed properties. Discrete Appl. Math. 79(1–3), 91–103 (1997)

    Article  MathSciNet  Google Scholar 

  11. Darabi, H., Alizadeh, Y., Klavžar, S., Das, C.K.: On the relation between Wiener index and eccentricity of a graph (2018). Manuscript. https://www.fmf.uni-lj.si/~klavzar/preprints/wiener-eccentricity%20(22%20Aug)%20submit.pdf

  12. Das, K.C., Nadjafi-Arani, M.J.: On maximum Wiener index of trees and graphs with given radius. J. Comb. Optim. 34(2), 574–587 (2017)

    Article  MathSciNet  Google Scholar 

  13. Diudea, M.D., Gutman, I.: Wiener-type topological indices. Croat. Chem. Acta 71(1), 21–51 (1998)

    Google Scholar 

  14. Dobrynin, A.A., Entringer, R., Gutman, I.: Wiener index of trees: theory and applications. Acta Appl. Math. 66(3), 211–249 (2001)

    Article  MathSciNet  Google Scholar 

  15. Gutman, I., Linert, W., Lukovits, I., Dobrynin, A.A.: Trees with extremal hyper-Wiener index: mathematical basis and chemical applications. J. Chem. Inf. Comput. Sci. 37(2), 349–354 (1997)

    Article  Google Scholar 

  16. Gutman, I., Furtula, B., Li, X.: Multicenter Wiener indices and their applications. J. Serb. Chem. Soc. 80(8), 1009–1017 (2015)

    Article  Google Scholar 

  17. Ilić, A., Yu, G., Feng, L.: On the Harary index of trees. Util. Math. 87, 21–32 (2012)

    MathSciNet  MATH  Google Scholar 

  18. Klein, D.J., Lukovits, I., Gutman, I.: On the definition of the hyper-Wiener index for cycle-containing structures. J. Chem. Inf. Comput. Sci. 35(1), 50–52 (1995)

    Article  Google Scholar 

  19. Knor, M., Škrekovski, R., Tepeh, A.: Mathematical aspects of Wiener index. Ars Math. Contemp. 1, 327–352 (2016)

    Article  MathSciNet  Google Scholar 

  20. Knor, M., Škrekovski, R., Tepeh, A.: Chemical graphs with the minimum value of Wiener index. MATCH Commun. Math. Comput. Chem. 81, 119–132 (2019)

    MATH  Google Scholar 

  21. Lesniak, L.: Eccentric sequences in graphs. Period. Math. Hung. 6(4), 287–293 (1975)

    Article  MathSciNet  Google Scholar 

  22. Li, X., Zhang, M.: Results on two kinds of Steiner distance-based indices for some classes of graphs. MATCH Commun. Math. Comput. Chem. 84, 567–568 (2020)

    Google Scholar 

  23. Li, X., Mao, Y., Gutman, I.: The Steiner Wiener index of a graph. Discuss. Math., Graph Theory 36(2), 455–465 (2016)

    Article  MathSciNet  Google Scholar 

  24. Li, X., Mao, Y., Gutman, I.: Inverse problem on the Steiner Wiener index. Discuss. Math., Graph Theory 38(1), 83–95 (2018)

    Article  MathSciNet  Google Scholar 

  25. Liu, H., Pan, X.F.: On the Wiener index of trees with fixed diameter. MATCH Commun. Math. Comput. Chem. 60(1), 85–94 (2008)

    MathSciNet  MATH  Google Scholar 

  26. Lu, L., Huang, Q., Hou, J., Chen, X.: A sharp lower bound on the Steiner Wiener index for trees with given diameter. Discrete Math. 341(3), 723–731 (2018)

    Article  MathSciNet  Google Scholar 

  27. Mukwembi, S., Vetrík, T.: Wiener index of trees of given order and diameter at most 6. Bull. Aust. Math. Soc. 89(3), 379–396 (2014)

    Article  MathSciNet  Google Scholar 

  28. Plesník, J.: On the sum of all distances in a graph or digraph. J. Graph Theory 8(1), 1–21 (1984)

    Article  MathSciNet  Google Scholar 

  29. Randić, M.: Novel molecular descriptor for structure-property studies. Chem. Phys. Lett. 211(4–5), 478–483 (1993)

    Article  Google Scholar 

  30. Schmuck, N.S., Wagner, S.G., Wang, H.: Greedy trees, caterpillars, and Wiener-type graph invariants. MATCH Commun. Math. Comput. Chem. 68(1), 273–292 (2012)

    MathSciNet  MATH  Google Scholar 

  31. Sun, Q., Ikica, B., S̆krekovski, R., Vukas̆inović, V.: Graphs with a given diameter that maximise the Wiener index. Appl. Math. Comput. 356, 438–448 (2019)

    Article  MathSciNet  Google Scholar 

  32. Wagner, S.G.: A class of trees and its Wiener index. Acta Appl. Math. 91, 119–132 (2006)

    Article  MathSciNet  Google Scholar 

  33. Wiener, H.: Structural determination of paraffin boiling points. J. Am. Chem. Soc. 69(1), 17–20 (1947)

    Article  Google Scholar 

  34. Xu, K., Liu, M., Das, K.C., Gutman, I., Furtula, B.: A survey on graphs extremal with respect to distance-based topological indices. MATCH Commun. Math. Comput. Chem. 71(3), 461–508 (2014)

    MathSciNet  MATH  Google Scholar 

  35. Yu, G., Feng, L., Ilić, A.: The hyper-Wiener index of trees with given parameters. Ars Comb. 96, 395–404 (2010)

    MathSciNet  MATH  Google Scholar 

  36. Zhang, J., Gentry, M., Wang, H., Jin, Y.L., Zhang, X.D.: On the inverse Steiner Wiener problem. MATCH Commun. Math. Comput. Chem. 82, 743–754 (2019)

    Google Scholar 

  37. Zhang, J., Zhang, G.-J., Wang, H., Zhang, X.-D.: Extremal trees with respect to the Steiner Wiener index. Discrete Math. Algorithms Appl. 11(6), 1950067 (2019)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Applied Mathematics, University of Johannesburg, P.O. Box 524, Auckland Park, Johannesburg, 2006, South Africa

    Peter Dankelmann & Audace A. V. Dossou-Olory

Authors
  1. Peter Dankelmann
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Audace A. V. Dossou-Olory
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Audace A. V. Dossou-Olory.

Additional information

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

This work is supported by the National Research Foundation of South Africa, grant 118521.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Dankelmann, P., Dossou-Olory, A.A.V. Bounding the \(k\)-Steiner Wiener and Wiener-Type Indices of Trees in Terms of Eccentric Sequence. Acta Appl Math 171, 15 (2021). https://doi.org/10.1007/s10440-021-00383-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s10440-021-00383-9

Keywords

Mathematics Subject Classification

Search

Navigation