The asymptotic number of non-isomorphic rooted trees obtained by rooting a tree

From MaRDI portal
Publication:890484




Abstract: Let mathcalTn be the set of trees with n vertices. Suppose that each tree in mathcalTn is equally likely. We show that the number of different rooted trees of a tree equals (mur+o(1))n for almost every tree of mathcalTn, where mur is a constant. As an application, we show that the number of any given pattern in mathcalTn is also asymptotically normally distributed with mean simmuMn and variance simsigmaMn, where muM,sigmaM are some constants related to the given pattern. This solves an open question claimed in Kok's thesis.









This page was built for publication: The asymptotic number of non-isomorphic rooted trees obtained by rooting a tree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q890484)