Dominance Order and Graphical Partitions
Abstract
We gave a new criterion for graphical partitions. We derive a new recursion formula, which allows the computation of the number $g(n)$ of graphical partitions of weight $n$ for up to $n>900$.
We gave a new criterion for graphical partitions. We derive a new recursion formula, which allows the computation of the number $g(n)$ of graphical partitions of weight $n$ for up to $n>900$.