Domination in Graphs
Domination Polynomials
Stored as list of coefficients, starting with the coefficient for
z0:
Total Number of Dominating Subsets
The total number of dominating subsets can be computed from the domination polynomials simply by evaluating them at
z=1.
But we have computed the total number of dominating subsets with our transfer matrix algorithm directly, which allowed us
to solve larger graphs. Hence this extra data files:
Updates and new entries in the OEIS
The data produced by the algorithm described in my paper above ("Domination polynomials of the Grid, ...") was used to extend the following sequences in the
Online Encyclopedia of Integer Sequences.
- A133515,
A133791,
A218354,
A218663,
A286514,
A286914,
A303334,
A347554,
A347557,
A347632,
A350815,
A350820
Furthermore these new entries are based on this paper: