Counting non-isomorphic tree-like multigraphs that include self-loops and multiple edges is an important problem in combinatorial enumeration, with applications in chemical graph theory, polymer science, and network modeling. Traditional counting techniques, such as Polya's theorem and branching algorithms, often face limitations due to symmetry handling and computational complexity. This study presents a unified dynamic programming framework for enumerating tree-like graphs characterized by a fixed number of vertices, self-loops, and multiple edges. The proposed method utilizes canonical rooted representations and recursive decomposition of subgraphs to eliminate redundant configurations, ensuring exact counting without the need for explicit structure generation. The framework also provides analytical bounds and recurrence relations that describe the growth behaviour of such multigraphs. This work extends previous models that treated self-loops and multiple edges separately, offering a general theoretical foundation for the enumeration of complex tree-like multigraphs in both mathematical and chemical domains.

翻译：暂无翻译