On Enumeration of some Non-Isomorphic Dendroids

Abstract

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.