A dendroid is a connected semigraph without a strong cycle. In this paper, we obtain the various results on the enumeration of the non-isomorphic dendroids containing two edges and the dendroids with three edges.
Bulletin of Mathematical Sciences and Applications (Volume 18)
P. R. Hampiholi and J. P. Kitturkar, "On Enumeration of some Non-Isomorphic Dendroids", Bulletin of Mathematical Sciences and Applications, Vol. 18, pp. 40-49, 2017