Prefer a chat interface with context about you and your work?
Comparative results between the number of subtrees and Wiener index of graphs
For a graph G , we denote by N ( G ) the number of non-empty subtrees of G . If G is connected, its Wiener index W ( G ) is the sum of distances between all unordered pairs of vertices of G . In this paper we establish …