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.
Similar content being viewed by others
References
Beineke, L.W., Pippert, R.E.: The number of labeled $k$-dimensional trees. J. Combin. Theory 6, 200–205 (1969)
Bickle, A.: Structural results on maximal $k$-degenerate graphs. Discuss. Math. Graph Theory 32, 659–676 (2012)
Bickle, A.: Maximal $k$-degenerate graphs with diameter 2 (to appear)
Buckley, F., Harary, F.: Distance in Graphs. Addison-Wesley, Redwood (1990)
Chartrand, G., Harary, F.: Planar permutation graphs. Ann. Inst. H. Poincaré Sect. B (N.S.) 3, 433–438 (1967)
Che, Z., Collins, K.L.: An upper bound on the Wiener index of a $k$-connected graph. arXiv:1811.02664 [math.CO]
Che, Z., Collins, K.L.: An upper bound on Wiener indices of maximal planar graphs. Discrete Appl. Math. 258, 76–86 (2019)
Czabarka, E., Dankelmann, P., Olsen, T., Székely, L.A.: Wiener index and remoteness in triangulations and quadrangulations. arXiv:1905.06753v1
Doyle, J.K., Graver, J.E.: Mean distance in a graph. Discrete Math. 7, 147–154 (1977)
Entringer, R.C., Jackson, D.E., Snyder, D.A.: Distance in graphs. Czech. Math. J. 26, 283–296 (1976)
Favaron, O., Kouider, M., Mahéo, M.: Edge-vulnerability and mean distance. Networks 19, 493–504 (1989)
Ghosh, D., Győri, E., Paulos, A., Salia, N., Zamora, O.: The maximum Wiener index of maximal planar graphs. arXiv:1912.02846
Harary, F.: Status and contrastatus. Sociometry 22, 23–43 (1959)
Lick, D.R., White, A.T.: $k$-degenerate graphs. Can. J. Math. 22, 1082–1096 (1970)
Patil, H.P.: On the structure of $k$-trees. J. Combin. Inf. Syst. Sci. 11, 57–64 (1986)
Plesník, J.: On the sum of all distances in a graph or digraph. J. Graph Theory 8, 1–21 (1984)
Wiener, H.: Structural determination of paraffin boiling points. J. Am. Chem. Soc. 69, 17–20 (1947)
Acknowledgements
The authors would like to thank the referees for their helpful comments.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
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
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-020-02264-8