Please use this identifier to cite or link to this item: https://research.matf.bg.ac.rs/handle/123456789/1748
Title: Determination of large families and diameter of equiseparable trees
Authors: Stanić, Zoran 
Affiliations: Numerical Mathematics and Optimization 
Keywords: equiseparable tree;saturation;number partition;diameter
Issue Date: 2006
Rank: M51
Publisher: Beograd : Matematički institut SANU
Journal: Publications de l’Institut Mathematique
Abstract: 
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.
URI: https://research.matf.bg.ac.rs/handle/123456789/1748
ISSN: 0350-1302
DOI: 10.2298/pim0693029s
Appears in Collections:Research outputs

Show full item record

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.