It is a known fact that the Wiener index (i.e. the sum of all distances between pairs of vertices in a graph) of a tree with an odd number of vertices is always even. In this paper, we consider the distribution of the Wiener index and the related tree parameter “internal path length” modulo 2 by means of a generating functions approach as well as by constructing bijections for plane trees
The Wiener index is a topological index defined as the sum of distances between all pairs of vertice...
The long-standing open problem of finding an upper bound for the Wiener index of a graph in terms of...
AbstractWe study a new family of trees for computation of the Wiener indices. We introduce general t...
AbstractIt is a known fact that the Wiener index (i.e. the sum of all distances between pairs of ver...
It is a known fact that the Wiener index (i.e. the sum of all distances between pairs of vertices in...
Abstract The Wiener index of a connected graph is defined as the sum of distances between all pairs ...
AbstractThe Wiener index of a graph is the sum of all pairwise distances of vertices of the graph. I...
AbstractThe Wiener index of a graph is the sum of the distances between all pairs of vertices. It ha...
AbstractThe Wiener index W(T) is defined as the sum of distances between all pairs of vertices of th...
The Wiener index of a graph is the sum of the distances between all pairs of vertices. It has been o...
A segment of a tree is a path whose ends are branching vertices (vertices of degree greater than 2) ...
The Wiener index of a graph, which is the sum of the distances between all pairs of vertices, has be...
AbstractThe Wiener index of a graph is the sum of the distances between all pairs of vertices, it ha...
The Wiener index of a graph is the sum of the distances between all pairs of vertices, it has been o...
Upper and lower bounds for the tail probabilities of the Wiener index of random binary search trees ...
The Wiener index is a topological index defined as the sum of distances between all pairs of vertice...
The long-standing open problem of finding an upper bound for the Wiener index of a graph in terms of...
AbstractWe study a new family of trees for computation of the Wiener indices. We introduce general t...
AbstractIt is a known fact that the Wiener index (i.e. the sum of all distances between pairs of ver...
It is a known fact that the Wiener index (i.e. the sum of all distances between pairs of vertices in...
Abstract The Wiener index of a connected graph is defined as the sum of distances between all pairs ...
AbstractThe Wiener index of a graph is the sum of all pairwise distances of vertices of the graph. I...
AbstractThe Wiener index of a graph is the sum of the distances between all pairs of vertices. It ha...
AbstractThe Wiener index W(T) is defined as the sum of distances between all pairs of vertices of th...
The Wiener index of a graph is the sum of the distances between all pairs of vertices. It has been o...
A segment of a tree is a path whose ends are branching vertices (vertices of degree greater than 2) ...
The Wiener index of a graph, which is the sum of the distances between all pairs of vertices, has be...
AbstractThe Wiener index of a graph is the sum of the distances between all pairs of vertices, it ha...
The Wiener index of a graph is the sum of the distances between all pairs of vertices, it has been o...
Upper and lower bounds for the tail probabilities of the Wiener index of random binary search trees ...
The Wiener index is a topological index defined as the sum of distances between all pairs of vertice...
The long-standing open problem of finding an upper bound for the Wiener index of a graph in terms of...
AbstractWe study a new family of trees for computation of the Wiener indices. We introduce general t...
DOI
Add to ORKG