Enumeration of tree-type diagrams assembled from oriented chains of edges
From MaRDI portal
Publication:6403792
arXiv2207.00766MaRDI QIDQ6403792FDOQ6403792
Authors: Oleksiy Khorunzhiy 
Publication date: 2 July 2022
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 oriented labeled -regular chains. Using a version of the Prfer code for Cayley trees, we generalize our result to the case when the chains are not necessarily regular.
Random matrices (probabilistic aspects) (60B20) Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30)
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)
