AbstractBy a theorem of Janson, the Wiener index of a random tree from a simply generated family of trees converges in distribution to a limit law that can be described in terms of the Brownian excursion. The family of unlabelled trees (rooted or unrooted), which is perhaps the most natural one from a graph-theoretical point of view, since isomorphisms are taken into account, is not covered directly by this theorem though. The aim of this paper is to show how one can prove the same limit law for unlabelled trees by means of generating functions and the method of moments
We study a new family of trees for computation of the Wiener indices. We introduce general tree tran...
The Brownian motion has played an important role in the development of probability theory and stocha...
AbstractWe study a new family of trees for computation of the Wiener indices. We introduce general t...
Upper and lower bounds for the tail probabilities of the Wiener index of random binary search trees ...
Upper and lower bounds for the tail probabilities of the Wiener index of random binary search trees ...
We consider the number of nodes in the levels of unlabeled rooted random trees and show that the joi...
AbstractWe consider the number of nodes in the levels of unlabelled rooted random trees and show tha...
Abstract. We consider the number of nodes in the levels of unlabeled rooted random trees and show th...
In this paper, we will consider the Wiener index for a class of trees that is connected to partition...
We exhibit a close connection between hitting times of the simple random walk on a graph, the Wiener...
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 ...
We show that the uniform unlabelled unrooted tree with n vertices and vertex degrees in a fixed set ...
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...
We study a new family of trees for computation of the Wiener indices. We introduce general tree tran...
The Brownian motion has played an important role in the development of probability theory and stocha...
AbstractWe study a new family of trees for computation of the Wiener indices. We introduce general t...
Upper and lower bounds for the tail probabilities of the Wiener index of random binary search trees ...
Upper and lower bounds for the tail probabilities of the Wiener index of random binary search trees ...
We consider the number of nodes in the levels of unlabeled rooted random trees and show that the joi...
AbstractWe consider the number of nodes in the levels of unlabelled rooted random trees and show tha...
Abstract. We consider the number of nodes in the levels of unlabeled rooted random trees and show th...
In this paper, we will consider the Wiener index for a class of trees that is connected to partition...
We exhibit a close connection between hitting times of the simple random walk on a graph, the Wiener...
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 ...
We show that the uniform unlabelled unrooted tree with n vertices and vertex degrees in a fixed set ...
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...
We study a new family of trees for computation of the Wiener indices. We introduce general tree tran...
The Brownian motion has played an important role in the development of probability theory and stocha...
AbstractWe study a new family of trees for computation of the Wiener indices. We introduce general t...