Let T be a tree all of whose internal vertices have degree at least three. In 1983 Jamison conjectured in JCT B that the average order of a subtree of T is at least half the order of T. In this paper a proof is provided. In addition, it is proved that the average order of a subtree of T is at most three quarters the order of T. Several open questions are stated
AbstractFor any tree T (labelled, not rooted) of order n, it will be shown that the average number o...
This article investigates some properties of the number of subtrees of a tree with given degree sequ...
We prove that among connected graphs of order n, the path uniquely minimises the average order of it...
Let T be a tree all of whose internal vertices have degree at least three. We show that the average ...
AbstractLet T be a tree all of whose internal vertices have degree at least three. In 1983 Jamison c...
We will consider two questions proposed by R. Jamison in 1983 regarding the average subtree order of...
We will consider two questions proposed by R. Jamison in 1983 regarding the average subtree order of...
We will consider two questions proposed by R. Jamison in 1983 regarding the average subtree order of...
For a tree T, the mean subtree order of T is the average order of a subtree of T. In 1984, Jamison c...
A subtree of a tree is any induced subgraph that is again a tree (i.e., connected). The mean subtree...
A subtree of a tree is any induced subgraph that is again a tree (i.e., connected). The mean subtree...
AbstractFor any tree T (labelled, not rooted) of order n, it will be shown that the average number o...
We will consider two questions related to the order (number of vertices) of subtrees: 1) Consider th...
AbstractThis paper is concerned with the average number of nodes in certain families of subtrees of ...
The global mean of subtrees of a tree is the average order (i.e., average number of vertices) of its...
AbstractFor any tree T (labelled, not rooted) of order n, it will be shown that the average number o...
This article investigates some properties of the number of subtrees of a tree with given degree sequ...
We prove that among connected graphs of order n, the path uniquely minimises the average order of it...
Let T be a tree all of whose internal vertices have degree at least three. We show that the average ...
AbstractLet T be a tree all of whose internal vertices have degree at least three. In 1983 Jamison c...
We will consider two questions proposed by R. Jamison in 1983 regarding the average subtree order of...
We will consider two questions proposed by R. Jamison in 1983 regarding the average subtree order of...
We will consider two questions proposed by R. Jamison in 1983 regarding the average subtree order of...
For a tree T, the mean subtree order of T is the average order of a subtree of T. In 1984, Jamison c...
A subtree of a tree is any induced subgraph that is again a tree (i.e., connected). The mean subtree...
A subtree of a tree is any induced subgraph that is again a tree (i.e., connected). The mean subtree...
AbstractFor any tree T (labelled, not rooted) of order n, it will be shown that the average number o...
We will consider two questions related to the order (number of vertices) of subtrees: 1) Consider th...
AbstractThis paper is concerned with the average number of nodes in certain families of subtrees of ...
The global mean of subtrees of a tree is the average order (i.e., average number of vertices) of its...
AbstractFor any tree T (labelled, not rooted) of order n, it will be shown that the average number o...
This article investigates some properties of the number of subtrees of a tree with given degree sequ...
We prove that among connected graphs of order n, the path uniquely minimises the average order of it...
DOI
Add to ORKG