A remark on branch weights in countable trees

Title:

A remark on branch weights in countable trees

Creator:

Zelinka, Bohdan

Identifier:

https://cdk.lib.cas.cz/client/handle/uuid:f4f36ff4-d5eb-456c-b4f1-13c88024ed59
uuid:f4f36ff4-d5eb-456c-b4f1-13c88024ed59
doi:10.21136/MB.2004.134108

Subject:

branch weight, branch weight centroid, tree; path, and degree of a vertex

Type:

model:article and TEXT

Format:

bez média and svazek

Description:

Let T be a tree, let u be its vertex. The branch weight b(u) of u is the maximum number of vertices of a branch of T at u. The set of vertices u of T in which b(u) attains its minimum is the branch weight centroid B(T) of T. For finite trees the present author proved that B(T) coincides with the median of T, therefore it consists of one vertex or of two adjacent vertices. In this paper we show that for infinite countable trees the situation is quite different.

Language:

English

Rights:

http://creativecommons.org/publicdomain/mark/1.0/
policy:public

Coverage:

29-31

Source:

Mathematica bohemica | 2004 Volume:129 | Number:1

Harvested from:

CDK

Metadata only:

false