Enumeration of Tree-like Multigraphs with a Given Number of Vertices, Self-loops and Multiple Edges

TL;DR

This paper introduces a dynamic programming framework for accurately counting complex tree-like multigraphs with self-loops and multiple edges, advancing combinatorial enumeration methods in mathematical and chemical graph theory.

Contribution

It develops a unified, recursive approach that handles symmetries and complexities, extending previous models to include self-loops and multiple edges in enumeration.

Findings

Provides exact enumeration formulas for tree-like multigraphs.

Establishes analytical bounds and recurrence relations.

Extends enumeration models to more complex multigraph structures.

Abstract

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.