Enumeration of labelled \((k,m)\)-trees (Q1284483)

A \(k\)-graph consists of a set of labelled vertices plus a collection of \(k\)-tuples of vertices called edges. Such a graph is a \((k,m)\)-tree if it can be obtained from a single edge by successively adding edges where each new edge consists of \(k-m\) new vertices and \(m\) vertices already belonging to some edge. The author derives an explicit formula for the number of \((k,m)\)-trees with \(e\) edges. When \(k=m+1\) the formula reduces to a formula given earlier by \textit{L. W. Beineke} and \textit{R. E. Pippert} [J. Comb. Theory 6, 200-205 (1969; Zbl 0175.20904)].