Identifier
Values
0 => ([(0,1)],2) => ([],2) => 2
1 => ([(0,1)],2) => ([],2) => 2
00 => ([(0,2),(2,1)],3) => ([],3) => 3
01 => ([(0,1),(0,2),(1,3),(2,3)],4) => ([(2,3)],4) => 3
10 => ([(0,1),(0,2),(1,3),(2,3)],4) => ([(2,3)],4) => 3
11 => ([(0,2),(2,1)],3) => ([],3) => 3
000 => ([(0,3),(2,1),(3,2)],4) => ([],4) => 4
001 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => ([(2,5),(3,4),(4,5)],6) => 4
010 => ([(0,1),(0,2),(1,4),(1,5),(2,4),(2,5),(4,3),(5,3)],6) => ([(2,5),(3,4)],6) => 4
011 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => ([(2,5),(3,4),(4,5)],6) => 4
100 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => ([(2,5),(3,4),(4,5)],6) => 4
101 => ([(0,1),(0,2),(1,4),(1,5),(2,4),(2,5),(4,3),(5,3)],6) => ([(2,5),(3,4)],6) => 4
110 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => ([(2,5),(3,4),(4,5)],6) => 4
111 => ([(0,3),(2,1),(3,2)],4) => ([],4) => 4
0000 => ([(0,4),(2,3),(3,1),(4,2)],5) => ([],5) => 5
1111 => ([(0,4),(2,3),(3,1),(4,2)],5) => ([],5) => 5
00000 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => ([],6) => 6
11111 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => ([],6) => 6
000000 => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7) => ([],7) => 7
111111 => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7) => ([],7) => 7
search for individual values
searching the database for the individual values of this statistic
/ search for generating function
searching the database for statistics with the same generating function
Description
The domination number of a graph.
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.
Map
incomparability graph
Description
The incomparability graph of a poset.
Map
poset of factors
Description
The poset of factors of a binary word.
This is the partial order on the set of distinct factors of a binary word, such that $u < v$ if and only if $u$ is a factor of $v$.