Shabat polynomials and monodromy groups of trees uniquely determined by ramification type (Q2424293)

A tree is a graph without any loops. A plane tree is a tree with an embedding into the plane or equivalently a tree together with an ordering of edges emanating from vertices. A map of plane trees preserving this extra structure is called an isomorphism of plane trees. Enumeration problem of isomorphism classes of plane trees as well as their complete list (in terms of their ramification types) is addressed in [\textit{G. Shabat} and \textit{A. Zvonkin}, Contemp. Math. 178, 233--275 (1994; Zbl 0816.05024)]. Building on this, the authors determine the corresponding Belyi maps (called Shabat polynomials) and their monodromy groups.