Skip to main content
Log in

Wiener Indices of Maximal k-Degenerate Graphs

  • Original Paper
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

A graph is maximal k-degenerate if each induced subgraph has a vertex of degree at most k and adding any new edge to the graph violates this condition. In this paper, we provide sharp lower and upper bounds on Wiener indices of maximal k-degenerate graphs of order \(n \ge k \ge 1\). A graph is chordal if every induced cycle in the graph is a triangle and chordal maximal k-degenerate graphs of order \(n \ge k\) are k-trees. For k-trees of order \(n \ge 2k+2\), we characterize all extremal graphs for the upper bound.

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

Access this article

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

Instant access to the full article PDF.

Fig. 1
Fig. 2

Similar content being viewed by others

References

  1. Beineke, L.W., Pippert, R.E.: The number of labeled $k$-dimensional trees. J. Combin. Theory 6, 200–205 (1969)

    Article  MathSciNet  Google Scholar 

  2. Bickle, A.: Structural results on maximal $k$-degenerate graphs. Discuss. Math. Graph Theory 32, 659–676 (2012)

    Article  MathSciNet  Google Scholar 

  3. Bickle, A.: Maximal $k$-degenerate graphs with diameter 2 (to appear)

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

    MATH  Google Scholar 

  5. Chartrand, G., Harary, F.: Planar permutation graphs. Ann. Inst. H. Poincaré Sect. B (N.S.) 3, 433–438 (1967)

    MathSciNet  MATH  Google Scholar 

  6. Che, Z., Collins, K.L.: An upper bound on the Wiener index of a $k$-connected graph. arXiv:1811.02664 [math.CO]

  7. Che, Z., Collins, K.L.: An upper bound on Wiener indices of maximal planar graphs. Discrete Appl. Math. 258, 76–86 (2019)

    Article  MathSciNet  Google Scholar 

  8. Czabarka, E., Dankelmann, P., Olsen, T., Székely, L.A.: Wiener index and remoteness in triangulations and quadrangulations. arXiv:1905.06753v1

  9. Doyle, J.K., Graver, J.E.: Mean distance in a graph. Discrete Math. 7, 147–154 (1977)

    Article  MathSciNet  Google Scholar 

  10. Entringer, R.C., Jackson, D.E., Snyder, D.A.: Distance in graphs. Czech. Math. J. 26, 283–296 (1976)

    Article  MathSciNet  Google Scholar 

  11. Favaron, O., Kouider, M., Mahéo, M.: Edge-vulnerability and mean distance. Networks 19, 493–504 (1989)

    Article  MathSciNet  Google Scholar 

  12. Ghosh, D., Győri, E., Paulos, A., Salia, N., Zamora, O.: The maximum Wiener index of maximal planar graphs. arXiv:1912.02846

  13. Harary, F.: Status and contrastatus. Sociometry 22, 23–43 (1959)

    Article  MathSciNet  Google Scholar 

  14. Lick, D.R., White, A.T.: $k$-degenerate graphs. Can. J. Math. 22, 1082–1096 (1970)

    Article  MathSciNet  Google Scholar 

  15. Patil, H.P.: On the structure of $k$-trees. J. Combin. Inf. Syst. Sci. 11, 57–64 (1986)

    MATH  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

Download references

Acknowledgements

The authors would like to thank the referees for their helpful comments.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zhongyuan Che.

Additional information

Publisher's Note

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

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Bickle, A., Che, Z. Wiener Indices of Maximal k-Degenerate Graphs. Graphs and Combinatorics 37, 581–589 (2021). https://doi.org/10.1007/s00373-020-02264-8

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-020-02264-8

Keywords

Navigation