EMIS ELibM Electronic Journals PUBLICATIONS DE L'INSTITUT MATHEMATIQUE (BEOGRAD) (N.S.)
Vol. 79(93), pp. 29–36 (2006)

Previous Article

Next Article

Contents of this Issue

Other Issues

ELibM Journals

ELibM Home

EMIS Home

Pick a mirror

 		 

DETERMINATION OF LARGE FAMILIES AND DIAMETER OF EQUISEPARABLE TREES

Zoran Stanic

Matematicki fakultet, Studentski trg 16, 11000 Beograd, Serbia

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.

Keywords: equiseparable tree; saturation; number partition; diameter

Classification (MSC2000): 05C05; 11P81

Full text of the article: (for faster download, first choose a mirror)

Electronic fulltext finalized on: 10 Oct 2006. This page was last modified: 27 Oct 2006.

© 2006 Mathematical Institute of the Serbian Academy of Science and Arts
© 2006 ELibM and FIZ Karlsruhe / Zentralblatt MATH for the EMIS Electronic Edition