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

MaRDI QIDQ6403792zbMATH OpenFDO

Authors Oleksiy Khorunzhiy

Publication date 2 July 2022

Mathematics Subject Classification ID

Random matrices (probabilistic aspects) (60B20) Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30)

Abstract: Using recurrent relation and analog of the Lagrange inversion theorem, we obtain an explicit formula for the number of tree-type diagrams assembled from $k$ oriented labeled $q$-regular chains. Using a version of the Pr$$fer code for Cayley trees, we generalize our result to the case when the chains are not necessarily regular.

This page was built for publication: Enumeration of tree-type diagrams assembled from oriented chains of edges

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6403792)