Exhaustive enumeration of unlabeled Riordan graphs, i.e. graphs whose adjacency matrix is a Riordan array (g,f) over Z₂. Computes u(n) for n≤17 by two independent C++/nauty methods (a third for n≤10), lists every graph with its generating functions and matrices, and samples them uniformly. Data, logs and tests included for full reproducibility..
computational-mathematics graph-theory combinatorics integer-sequences graph-isomorphism random-graphs cpp20 algebraic-combinatorics graph-sampling mathematical-software generating-functions graph-enumeration enumerative-combinatorics riordan-graphs riordan-array riordan-group unlabeled-graphs
-
Updated
Oct 12, 2026 - C++