Enumeration of tree-type diagrams assembled from oriented chains of edges

We study a family of tree-type diagrams that arise in studies of the cumulant expansion in discrete Erd\H os-Rényi random matrix models. Using a version of the Pr" ufer code, we obtain an explicit expression for the number of tree-type diagrams assembled from $k$ oriented chains of $q$ edges. Using this modified Prüfer codification, we get an explicit expression for sum overs weighted tree-type diagrams with a weight depending on multiplicity of edges. We describe similar results for tree-type diagrams assembled from chains that are not necessarily regular.