{"title":"DETERMINATION OF LARGE FAMILIES AND DIAMETER OF EQUISEPARABLE TREES","authors":"Z. Stanić","doi":"10.2298/PIM0693029S","DOIUrl":null,"url":null,"abstract":"We consider the problem of determining all the members of an arbitrary family of equiseparable trees. We introduce the concept of satura- tion (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 equi- separable trees with m edges. We prove that this bound is equal to (m� 4)/3, where m is the size of trees.","PeriodicalId":416273,"journal":{"name":"Publications De L'institut Mathematique","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Publications De L'institut Mathematique","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2298/PIM0693029S","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
We consider the problem of determining all the members of an arbitrary family of equiseparable trees. We introduce the concept of satura- tion (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 equi- separable trees with m edges. We prove that this bound is equal to (m� 4)/3, where m is the size of trees.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
