Exact enumeration of graphs and bipartite graphs with degree constraints

Abstract

We provide a new explicit formula enumerating graphs with constraints on their degrees, such as regular graphs, and extend it to bipartite graphs. It relies on generating function manipulations and Hadamard products.\\ \textbf{Keywords.} regular graphs, exact enumeration, D-finite, differentiably finite