Your data matches 1 statistic following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St001794
Mapping
St001794: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => 0
([],2)
 => 0
([(0,1)],2)
 => 1
([],3)
 => 0
([(1,2)],3)
 => 0
([(0,2),(1,2)],3)
 => 1
([(0,1),(0,2),(1,2)],3)
 => 3
([],4)
 => 0
([(2,3)],4)
 => 0
([(1,3),(2,3)],4)
 => 0
([(0,3),(1,3),(2,3)],4)
 => 1
([(0,3),(1,2)],4)
 => 2
([(0,3),(1,2),(2,3)],4)
 => 2
([(1,2),(1,3),(2,3)],4)
 => 0
([(0,3),(1,2),(1,3),(2,3)],4)
 => 3
([(0,2),(0,3),(1,2),(1,3)],4)
 => 3
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 5
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 7
([],5)
 => 0
([(3,4)],5)
 => 0
([(2,4),(3,4)],5)
 => 0
([(1,4),(2,4),(3,4)],5)
 => 0
([(0,4),(1,4),(2,4),(3,4)],5)
 => 1
([(1,4),(2,3)],5)
 => 0
([(1,4),(2,3),(3,4)],5)
 => 0
([(0,1),(2,4),(3,4)],5)
 => 2
([(2,3),(2,4),(3,4)],5)
 => 0
([(0,4),(1,4),(2,3),(3,4)],5)
 => 2
([(1,4),(2,3),(2,4),(3,4)],5)
 => 0
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
 => 3
([(1,3),(1,4),(2,3),(2,4)],5)
 => 0
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
 => 4
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 0
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => 3
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 5
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
 => 7
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 9
([(0,4),(1,3),(2,3),(2,4)],5)
 => 3
([(0,1),(2,3),(2,4),(3,4)],5)
 => 6
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
 => 6
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
 => 9
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => 5
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => 7
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => 9
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
 => 6
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 0
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 7
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 11
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
 => 9
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
 => 11
Description
Half the number of sets of vertices in a graph which are dominating and non-blocking. A set of vertices $U$ in a graph is dominating, if every vertex not in $U$ is adjacent to a vertex in $U$. A set of vertices $U$ in a graph is non-blocking, if every vertex in $U$ is adjacent to a vertex not in $U$. Therefore, a set of vertices is non-blocking if and only if its complement is dominating. In particular, if a set of vertices is dominating and non-blocking, so is its complement.