DOIAbstract
AbstractLet G be a tree and k a non-negative integer. We determine best possible upper and lower bounds on the number of pairs of vertices at distance exactly k in G in terms of order alone, and in terms of order and radius or diameter
AbstractLet G be a tree and k a non-negative integer. We determine best possible upper and lower bounds on the number of pairs of vertices at distance exactly k in G in terms of order alone, and in terms of order and radius or diameter
This paper deals with statistics concerning distances between randomly chosen nodes in varieties of ...
The rotation distance d(S,T) between two binary trees S, T of n vertices is the minimum number of ro...
AbstractWe develop combinatorial methods for establishing lower bounds on the rotation distance betw...
AbstractLet G be a tree and k a non-negative integer. We determine best possible upper and lower bou...
The distance of a tree is the sum of the distances between all pairs of vertices in the tree. This t...
AbstractWe study the quantity distance between node j and node n in a random tree of size n chosen f...
This paper deals with statistics concerning distances between randomly chosen nodes in varieties of ...
AbstractWe characterize the quantities which can arise as the mean distance in a tree, giving in eac...
This paper deals with statistics concerning distances between randomly chosen nodes in varieties o...
A fundamental problem in network science is the normalization of the topological or physical distanc...
ABSTRACT. A formula for the determinant of the distance matrix for a tree as a function of the numbe...
The sum of distances between vertices of a tree has been considered from many aspects. The question ...
AbstractUsing a weaker variant of the well-known dominance order on partitions, we determine the tre...
Abstract—The Robinson-Foulds (RF) distance is by far the most widely used measure of dissimilarity b...
The Robinson-Foulds (RF) distance is by far the most widely used measure of dissimilarity between tr...
This paper deals with statistics concerning distances between randomly chosen nodes in varieties of ...
The rotation distance d(S,T) between two binary trees S, T of n vertices is the minimum number of ro...
AbstractWe develop combinatorial methods for establishing lower bounds on the rotation distance betw...
AbstractLet G be a tree and k a non-negative integer. We determine best possible upper and lower bou...
The distance of a tree is the sum of the distances between all pairs of vertices in the tree. This t...
AbstractWe study the quantity distance between node j and node n in a random tree of size n chosen f...
This paper deals with statistics concerning distances between randomly chosen nodes in varieties of ...
AbstractWe characterize the quantities which can arise as the mean distance in a tree, giving in eac...
This paper deals with statistics concerning distances between randomly chosen nodes in varieties o...
A fundamental problem in network science is the normalization of the topological or physical distanc...
ABSTRACT. A formula for the determinant of the distance matrix for a tree as a function of the numbe...
The sum of distances between vertices of a tree has been considered from many aspects. The question ...
AbstractUsing a weaker variant of the well-known dominance order on partitions, we determine the tre...
Abstract—The Robinson-Foulds (RF) distance is by far the most widely used measure of dissimilarity b...
The Robinson-Foulds (RF) distance is by far the most widely used measure of dissimilarity between tr...
This paper deals with statistics concerning distances between randomly chosen nodes in varieties of ...
The rotation distance d(S,T) between two binary trees S, T of n vertices is the minimum number of ro...
AbstractWe develop combinatorial methods for establishing lower bounds on the rotation distance betw...
Add to ORKG