EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Subtree Number versus Wiener Index

Martin Knor, Jelena Sedlar, Riste Škrekovski, Yu Yang

Match Communications in Mathematical and in Computer Chemistry · 12.03.2026 · 3 (96) · 961

DOI: 10.46793/match.96-3.25225 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Match Communications in Mathematical and in Computer Chemistry, online erschienen am 12.03.2026. Verfasst von Martin Knor und 3 weiteren Autor:innen. Die Arbeit nennt 19 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The subtree number N(G) of a graph G is defined as the number of non-empty subtrees of G. The Wiener index W(G) of a graph G is defined as the sum of distances over all pairs of vertices in G. It has been noted that, for many families of trees and graphs, the graphs that achieve the largest number of subtrees are exactly those that attain the smallest Wiener index, and vice versa. Consequently, it is often said that the subtree number and the Wiener index have a ”negative” correlation. In this paper, we show that, except for extremal graphs, this ”negative” correlation does not generally hold. In particular, for every n ≥ 14, we construct a pair of unicyclic graphs G and H, each having n vertices and identical degree sequences, such that W(G) < W(H) and N(G) < N(H). Furthermore, our construction shows that both differences, N(H) − N(G) and W(H) − W(G), grow unbounded as n increases.

Zitieren

APA

Knor, M., Sedlar, J., Škrekovski, R., & Yang, Y. (2026). Subtree Number versus Wiener Index. Match Communications in Mathematical and in Computer Chemistry, 3(96), 961. https://doi.org/10.46793/match.96-3.25225

Vancouver

Knor M, Sedlar J, Škrekovski R, Yang Y. Subtree Number versus Wiener Index. Match Communications in Mathematical and in Computer Chemistry. 2026;3(96):961. doi:10.46793/match.96-3.25225

BibTeX
@article{Knor2026,
  author = {Knor, Martin and Sedlar, Jelena and Škrekovski, Riste and Yang, Yu},
  title = {Subtree Number versus Wiener Index},
  journal = {Match Communications in Mathematical and in Computer Chemistry},
  year = {2026},
  volume = {3},
  number = {96},
  pages = {961},
  doi = {10.46793/match.96-3.25225}
}
Kostenlos starten →