Determination of Large Families and Diameter of Equiseparable Trees
Publications de l'Institut Mathématique, _N_S_79 (2006) no. 93, p. 29
We consider the problem of determining all the members of an
arbitrary family of equiseparable trees. We introduce the concept
of saturation (based on the number partitions). After that, we use
the same concept to obtain the least upper bound for the
difference in the diameters of two equiseparable trees with m
edges. We prove that this bound is equal to $(m-4)/3$, where $m$
is the size of trees.
DOI :
10.2298/PIM0693029S
Classification :
05C05 11P81
Keywords: equiseparable tree, saturation, number partition, diameter
Keywords: equiseparable tree, saturation, number partition, diameter
@article{10_2298_PIM0693029S,
author = {Zoran Stani\'c},
title = {Determination of {Large} {Families} and {Diameter} of {Equiseparable} {Trees}},
journal = {Publications de l'Institut Math\'ematique},
pages = {29 },
year = {2006},
volume = {_N_S_79},
number = {93},
doi = {10.2298/PIM0693029S},
zbl = {1121.05032},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.2298/PIM0693029S/}
}
TY - JOUR AU - Zoran Stanić TI - Determination of Large Families and Diameter of Equiseparable Trees JO - Publications de l'Institut Mathématique PY - 2006 SP - 29 VL - _N_S_79 IS - 93 UR - http://geodesic.mathdoc.fr/articles/10.2298/PIM0693029S/ DO - 10.2298/PIM0693029S LA - en ID - 10_2298_PIM0693029S ER -
Zoran Stanić. Determination of Large Families and Diameter of Equiseparable Trees. Publications de l'Institut Mathématique, _N_S_79 (2006) no. 93, p. 29 . doi: 10.2298/PIM0693029S
Cité par Sources :