Skip to main content
SpringerLink
Log in

The average Steiner 3-eccentricity of block graphs

  • Original Research
  • Published:
Journal of Applied Mathematics and Computing Aims and scope Submit manuscript

Abstract

In this work, we study the average Steiner 3-eccentricity on block graphs with a fixed block order sequence. Two graph transformations are present on block graphs. Relying on the transformations, we establish both the lower bound and the upper bound for the average Steiner 3-eccentricity on block graphs with a fixed block order sequence. Finally, we devise an \(O(n^{2})\) algorithm to calculate the average Steiner 3-eccentricity on block graphes where n is the order of the graph.

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
Fig. 3

Similar content being viewed by others

References

  1. Ali, P., Dankelmann, P., Morgan, M.J., et al.: The average eccentricity, spanning trees of plane graphs, size and order. Util. Math. 107, 37–49 (2018)

    MathSciNet  MATH  Google Scholar 

  2. Anand, B.S., Changat, M., Klavzar, S., Peterin, I.: Convex sets in lexicographic product of graphs. Graphs Combin. 28, 77–84 (2012)

    Article  MathSciNet  Google Scholar 

  3. Beineke, L.W., Oellermann, O.R., Pippert, R.E.: On the Steiner median of a tree. Discrete Appl. Math. 68, 249–258 (1996)

    Article  MathSciNet  Google Scholar 

  4. Buckley, F., Harary, F.: Distance in Graphs. Addisson-Wesley, Redwood City (1990)

    MATH  Google Scholar 

  5. Chartrand, G., Oellermann, O.R., Tian, S., Zou, H.B.: Steiner distance in graphs. Ćasopis pro pěstóvani matematiky 114, 399–410 (1989)

    Article  MathSciNet  Google Scholar 

  6. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithme. MIT Press, Cambridge (2001)

    MATH  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  8. 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 

  9. Dankelmann, P., Goddard, W., Swart, C.: The average eccentricity of a graph and its subgraphs. Util. Math. 65, 41–51 (2004)

    MathSciNet  MATH  Google Scholar 

  10. Dankelmann, P., Mukwembi, S.: Upper bounds on the average eccentricity. Discrete Appl. Math. 167, 72–79 (2014)

    Article  MathSciNet  Google Scholar 

  11. Dankelmann, P., Osaye, F.J.: Average eccentricity, k-packing and k-domination in graphs. Discrete Math. 342, 1261–1274 (2019)

    Article  MathSciNet  Google Scholar 

  12. Dankelmann, P., Osaye, F.J., Mukwembi, S., Rodrigues, B.: Upper bounds on the average eccentricity of K3-free and C4-free graphs. Discrete Appl. Math. 270(1), 106–114 (2019)

    Article  MathSciNet  Google Scholar 

  13. Du, Z., Ilić, A.: On AGX conjectures regarding average eccentricity. MATCH Commun. Math. Comput. Chem. 69, 597–609 (2013)

    MathSciNet  MATH  Google Scholar 

  14. Du, Z., Ilić, A.: A proof of the conjecture regarding the sum of the domination number and average eccentricity. Discrete Appl. Math. 201, 105–113 (2016)

    Article  MathSciNet  Google Scholar 

  15. Garey, M.R., Johnson, D.S.: Computers and Intractibility: A Guide to the Theory of NP-Completeness. Freeman & Company, New York (1979)

    MATH  Google Scholar 

  16. Ghorbani, M., Li, X., Maimani, H.R., Mao, Y., Rahmani, S., Parsa, M.R.: Steiner (revised) Szeged index of graphs. MATCH Commun. Math. Comput. Chem. 82, 733–742 (2019)

    Google Scholar 

  17. Gologranc, T.: Steiner convex sets and Cartesian product. Bull. Malays. Math. Sci. Soc. 41, 627–636 (2018)

    MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  19. Gutman, I.: On Steiner degree distance of trees. Appl. Math. Comput. 283, 163–167 (2016)

    MathSciNet  MATH  Google Scholar 

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

    Article  Google Scholar 

  21. Hwang, F.K., Richards, D.S., Winter, P.: The Steiner Tree Problem, vol. 53. North-Holland, Amsterdam (1992)

    MATH  Google Scholar 

  22. Ilić, A.: On the extremal properties of the average eccentricity. Comput. Math. Appl. 64(9), 2877–2885 (2012)

    Article  MathSciNet  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. 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, 723–731 (2018)

    Article  MathSciNet  Google Scholar 

  25. Mao, Y., Das, K.C.: Steiner Gutman index. MATCH Commun. Math. Comput. Chem. 79(3), 779–794 (2018)

    MathSciNet  Google Scholar 

  26. Mao, Y.: Steiner Distance in Graphs—A Survey. arXiv:1708.05779 (2017)

  27. Mao, Y., Cheng, E., Wang, Z.: Steiner distance in product networks. Discrete Math. Theor. Comput. Sci. 20(2), 8 (2018). https://doi.org/10.23638/DMTCS-20-2-8

  28. Smith, H., Székely, L.A., Wang, H.: Eccentricity sum in trees. Discrete Appl. Math. 207, 120–131 (2016)

    Article  MathSciNet  Google Scholar 

  29. Tang, Y., Zhou, B.: On average eccentricity. MATCH Commun. Math. Comput. Chem. 67, 405–423 (2012)

    MathSciNet  MATH  Google Scholar 

  30. Tratnik, N.: On the Steiner hyper-Wiener index of a graph. Appl. Math. Comput. 337(15), 360–371 (2019)

    MathSciNet  MATH  Google Scholar 

  31. Wang, Z., Mao, Y., Melekian, C., Cheng, E.: Steiner distance in join, corona, and threshold graphs. In: The 14th International Symposium on Pervasive Systems. Algorithms and Networks (2017). https://doi.org/10.1109/ISPAN-FCST-ISCC.2017.39

  32. Wei, M., Yue, J., Zhu, X.: On the edge metric dimension of graphs. AIMS Math. 5(5), 4459–4465 (2020)

    Article  MathSciNet  Google Scholar 

  33. Yue, J., Lei, H., Shi, Y.: On the generalized Wiener polarity index of trees with a given diameter. Discrete Appl. Math. 243, 279–285 (2017)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

Funding was provided by National Natural Science Foundation of China (Grant No. 11861019), Natural Science Foundation of Guizhou (Grant No. [2020]1Z001) and Guizhou Talent Development Project in Science and Technology (Grant No. KY[2018]046).

Author information

Authors and Affiliations

  1. College of Big Data Statistics, Guizhou University of Finance and Economics, Guiyang, 550025, Guizhou, China

    Xingfu Li & Guihai Yu

Authors
  1. Xingfu Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Guihai Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Guihai Yu.

Additional information

Publisher's Note

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

This work was supported by the Natural Science Foundation of Guizhou ([2019]1047), Foundation of Guizhou University of Finance and Economics (2019XJC04).

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Li, X., Yu, G. The average Steiner 3-eccentricity of block graphs. J. Appl. Math. Comput. 67, 89–100 (2021). https://doi.org/10.1007/s12190-020-01473-x

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12190-020-01473-x

Keywords

Mathematics Subject Classification

Search

Navigation