

A263284


Triangle read by rows: T(n,k) is the number of graphs on n vertices with domination number k.


9



1, 1, 1, 2, 1, 1, 4, 5, 1, 1, 11, 16, 5, 1, 1, 34, 94, 21, 5, 1, 1, 156, 708, 152, 21, 5, 1, 1, 1044, 9384, 1724, 166, 21, 5, 1, 1, 12346, 221135, 38996, 1997, 166, 21, 5, 1, 1, 274668, 9877969, 1800340, 49961, 2036, 166, 21, 5, 1, 1
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,4


COMMENTS

The domination number of a graph is given by the minimum size of a dominating set of vertices. A dominating set of vertices is a subset of the vertex set of such that every vertex is either in this subset or adjacent to an element of this subset.
For any graph the domination number is greater than or equal to the irredundance number (A332404) and less than or equal to the independent domination number (A332402).  Andrew Howroyd, Feb 13 2020


LINKS



FORMULA



EXAMPLE

Triangle begins:
1;
1, 1;
2, 1, 1;
4, 5, 1, 1;
11, 16, 5, 1, 1;
34, 94, 21, 5, 1, 1;
156, 708, 152, 21, 5, 1, 1;
1044, 9384, 1724, 166, 21, 5, 1, 1;
12346, 221135, 38996, 1997, 166, 21, 5, 1, 1;
274668, 9877969, 1800340, 49961, 2036, 166, 21, 5, 1, 1;
...


CROSSREFS



KEYWORD



AUTHOR



EXTENSIONS



STATUS

approved



