Your data matches 294 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St000260
(load all 8 compositions to match this statistic)
Mapping
Mp00154: Graphs —core⟶ Graphs
St000260: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,1),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => 2 = 1 + 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 1 = 0 + 1
([(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,5),(2,4),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,2),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,4),(2,3),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,1),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,4),(1,5),(2,3),(2,5),(3,4)],6)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => 2 = 1 + 1
([(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => 2 = 1 + 1
([(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,4),(2,3),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
Description
The radius of a connected graph. This is the minimum eccentricity of any vertex.
Matching statistic: St000273
(load all 8 compositions to match this statistic)
Mapping
Mp00154: Graphs —core⟶ Graphs
St000273: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,1),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => 2 = 1 + 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 1 = 0 + 1
([(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,5),(2,4),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,2),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,4),(2,3),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,1),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,4),(1,5),(2,3),(2,5),(3,4)],6)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => 2 = 1 + 1
([(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => 2 = 1 + 1
([(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,4),(2,3),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
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.
Matching statistic: St000544
(load all 8 compositions to match this statistic)
Mapping
Mp00154: Graphs —core⟶ Graphs
St000544: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,1),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => 2 = 1 + 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 1 = 0 + 1
([(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,5),(2,4),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,2),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,4),(2,3),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,1),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,4),(1,5),(2,3),(2,5),(3,4)],6)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => 2 = 1 + 1
([(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => 2 = 1 + 1
([(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,4),(2,3),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
Description
The cop number of a graph. This is the minimal number of cops needed to catch the robber. The algorithm is from [2].
Matching statistic: St000917
(load all 10 compositions to match this statistic)
Mapping
Mp00154: Graphs —core⟶ Graphs
St000917: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,1),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => 2 = 1 + 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 1 = 0 + 1
([(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,5),(2,4),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,2),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,4),(2,3),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,1),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,4),(1,5),(2,3),(2,5),(3,4)],6)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => 2 = 1 + 1
([(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => 2 = 1 + 1
([(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,4),(2,3),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
Description
The open packing number of a graph. This is the size of a largest subset of vertices of a graph, such that any two distinct vertices in the subset have disjoint open neighbourhood.
Matching statistic: St001322
(load all 9 compositions to match this statistic)
Mapping
Mp00154: Graphs —core⟶ Graphs
St001322: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,1),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => 2 = 1 + 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 1 = 0 + 1
([(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,5),(2,4),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,2),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,4),(2,3),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,1),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,4),(1,5),(2,3),(2,5),(3,4)],6)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => 2 = 1 + 1
([(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => 2 = 1 + 1
([(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,4),(2,3),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
Description
The size of a minimal independent dominating set in a graph.
Matching statistic: St001333
(load all 10 compositions to match this statistic)
Mapping
Mp00154: Graphs —core⟶ Graphs
St001333: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,1),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => 2 = 1 + 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 1 = 0 + 1
([(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,5),(2,4),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,2),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,4),(2,3),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,1),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,4),(1,5),(2,3),(2,5),(3,4)],6)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => 2 = 1 + 1
([(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => 2 = 1 + 1
([(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,4),(2,3),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
Description
The cardinality of a minimal edge-isolating set of a graph. Let $\mathcal F$ be a set of graphs. A set of vertices $S$ is $\mathcal F$-isolating, if the subgraph induced by the vertices in the complement of the closed neighbourhood of $S$ does not contain any graph in $\mathcal F$. This statistic returns the cardinality of the smallest isolating set when $\mathcal F$ contains only the graph with one edge.
Matching statistic: St001339
(load all 9 compositions to match this statistic)
Mapping
Mp00154: Graphs —core⟶ Graphs
St001339: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,1),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => 2 = 1 + 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 1 = 0 + 1
([(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,5),(2,4),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,2),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,4),(2,3),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,1),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,4),(1,5),(2,3),(2,5),(3,4)],6)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => 2 = 1 + 1
([(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => 2 = 1 + 1
([(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,4),(2,3),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
Description
The irredundance number of a graph. A set $S$ of vertices is irredundant, if there is no vertex in $S$, whose closed neighbourhood is contained in the union of the closed neighbourhoods of the other vertices of $S$. The irredundance number is the smallest size of a maximal irredundant set.
Matching statistic: St001340
(load all 10 compositions to match this statistic)
Mapping
Mp00154: Graphs —core⟶ Graphs
St001340: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,1),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => 2 = 1 + 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 1 = 0 + 1
([(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,5),(2,4),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,2),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,4),(2,3),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,1),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,4),(1,5),(2,3),(2,5),(3,4)],6)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => 2 = 1 + 1
([(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => 2 = 1 + 1
([(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,4),(2,3),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
Description
The cardinality of a minimal non-edge isolating set of a graph. Let $\mathcal F$ be a set of graphs. A set of vertices $S$ is $\mathcal F$-isolating, if the subgraph induced by the vertices in the complement of the closed neighbourhood of $S$ does not contain any graph in $\mathcal F$. This statistic returns the cardinality of the smallest isolating set when $\mathcal F$ contains only the graph with two isolated vertices.
Matching statistic: St001776
(load all 13 compositions to match this statistic)
Mapping
Mp00154: Graphs —core⟶ Graphs
St001776: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,1),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => 2 = 1 + 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 1 = 0 + 1
([(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,5),(2,4),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,2),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,4),(2,3),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,1),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,4),(1,5),(2,3),(2,5),(3,4)],6)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => 2 = 1 + 1
([(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => 2 = 1 + 1
([(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,4),(2,3),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
Description
The degree of the minimal polynomial of the largest Laplacian eigenvalue of a graph.
Matching statistic: St001829
(load all 8 compositions to match this statistic)
Mapping
Mp00154: Graphs —core⟶ Graphs
St001829: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,1),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => 2 = 1 + 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 1 = 0 + 1
([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 1 = 0 + 1
([(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,5),(2,4),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,2),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,4),(2,3),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,1),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,4),(1,5),(2,3),(2,5),(3,4)],6)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => 2 = 1 + 1
([(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => 2 = 1 + 1
([(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,5),(1,4),(2,3),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
Description
The common independence number of a graph. The common independence number of a graph $G$ is the greatest integer $r$ such that every vertex of $G$ belongs to some independent set $X$ of vertices of cardinality at least $r$.
The following 284 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000258The burning number of a graph. St000918The 2-limited packing number of a graph. St000303The determinant of the product of the incidence matrix and its transpose of a graph divided by $4$. St000379The number of Hamiltonian cycles in a graph. St000671The maximin edge-connectivity for choosing a subgraph. St001056The Grundy value for the game of deleting vertices of a graph until it has no edges. St001324The minimal number of occurrences of the chordal-pattern in a linear ordering of the vertices of the graph. St001325The minimal number of occurrences of the comparability-pattern in a linear ordering of the vertices of the graph. St001353The number of prime nodes in the modular decomposition of a graph. St001691The number of kings in a graph. St001793The difference between the clique number and the chromatic number of a graph. St001798The difference of the number of edges in a graph and the number of edges in the complement of the Turán graph. St000093The cardinality of a maximal independent set of vertices of a graph. St000259The diameter of a connected graph. St000535The rank-width of a graph. St000786The maximal number of occurrences of a colour in a proper colouring of a graph. St000905The number of different multiplicities of parts of an integer composition. St001271The competition number of a graph. St001316The domatic number of a graph. St001337The upper domination number of a graph. St001338The upper irredundance number of a graph. St001774The degree of the minimal polynomial of the smallest eigenvalue of a graph. St000452The number of distinct eigenvalues of a graph. St000453The number of distinct Laplacian eigenvalues of a graph. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St001261The Castelnuovo-Mumford regularity of a graph. St001315The dissociation number of a graph. St001674The number of vertices of the largest induced star graph in the graph. St001738The minimal order of a graph which is not an induced subgraph of the given graph. St000089The absolute variation of a composition. St000091The descent variation of a composition. St000096The number of spanning trees of a graph. St000149The number of cells of the partition whose leg is zero and arm is odd. St000271The chromatic index of a graph. St000276The size of the preimage of the map 'to graph' from Ordered trees to Graphs. St000283The size of the preimage of the map 'to graph' from Binary trees to Graphs. St000312The number of leaves in a graph. St000478Another weight of a partition according to Alladi. St000552The number of cut vertices of a graph. St000761The number of ascents in an integer composition. St000766The number of inversions of an integer composition. St000769The major index of a composition regarded as a word. St000807The sum of the heights of the valleys of the associated bargraph. St000948The chromatic discriminant of a graph. St001071The beta invariant of the graph. St001121The multiplicity of the irreducible representation indexed by the partition in the Kronecker square corresponding to the partition. St001123The multiplicity of the dual of the standard representation in the Kronecker square corresponding to a partition. St001311The cyclomatic number of a graph. St001317The minimal number of occurrences of the forest-pattern in a linear ordering of the vertices of the graph. St001328The minimal number of occurrences of the bipartite-pattern in a linear ordering of the vertices of the graph. St001331The size of the minimal feedback vertex set. St001335The cardinality of a minimal cycle-isolating set of a graph. St001349The number of different graphs obtained from the given graph by removing an edge. St001356The number of vertices in prime modules of a graph. St001392The largest nonnegative integer which is not a part and is smaller than the largest part of the partition. St001393The induced matching number of a graph. St001479The number of bridges of a graph. St001484The number of singletons of an integer partition. St001570The minimal number of edges to add to make a graph Hamiltonian. St001572The minimal number of edges to remove to make a graph bipartite. St001604The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on polygons. St001606The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on set partitions. St001638The book thickness of a graph. St001673The degree of asymmetry of an integer composition. St001675The number of parts equal to the part in the reversed composition. St001689The number of celebrities in a graph. St001692The number of vertices with higher degree than the average degree in a graph. St001723The differential of a graph. St001724The 2-packing differential of a graph. St001736The total number of cycles in a graph. St001777The number of weak descents in an integer composition. St001795The binary logarithm of the evaluation of the Tutte polynomial of the graph at (x,y) equal to (-1,-1). St001796The absolute value of the quotient of the Tutte polynomial of the graph at (1,1) and (-1,-1). St001797The number of overfull subgraphs of a graph. St001826The maximal number of leaves on a vertex of a graph. St001913The number of preimages of an integer partition in Bulgarian solitaire. St000097The order of the largest clique of the graph. St000268The number of strongly connected orientations of a graph. St000381The largest part of an integer composition. St000382The first part of an integer composition. St000388The number of orbits of vertices of a graph under automorphisms. St000450The number of edges minus the number of vertices plus 2 of a graph. St000553The number of blocks of a graph. St000667The greatest common divisor of the parts of the partition. St000757The length of the longest weakly inreasing subsequence of parts of an integer composition. St000758The length of the longest staircase fitting into an integer composition. St000760The length of the longest strictly decreasing subsequence of parts of an integer composition. St000764The number of strong records in an integer composition. St000765The number of weak records in an integer composition. St000767The number of runs in an integer composition. St000805The number of peaks of the associated bargraph. St000808The number of up steps of the associated bargraph. St000816The number of standard composition tableaux of the composition. St000820The number of compositions obtained by rotating the composition. St000897The number of different multiplicities of parts of an integer partition. St000899The maximal number of repetitions of an integer composition. St000902 The minimal number of repetitions of an integer composition. St000903The number of different parts of an integer composition. St000904The maximal number of repetitions of an integer composition. St001057The Grundy value of the game of creating an independent set in a graph. St001073The number of nowhere zero 3-flows of a graph. St001330The hat guessing number of a graph. St001571The Cartan determinant of the integer partition. St001672The restrained domination number of a graph. St001716The 1-improper chromatic number of a graph. St001740The number of graphs with the same symmetric edge polytope as the given graph. St001765The number of connected components of the friends and strangers graph. St001775The degree of the minimal polynomial of the largest eigenvalue of a graph. St001940The number of distinct parts that are equal to their multiplicity in the integer partition. St001951The number of factors in the disjoint direct product decomposition of the automorphism group of a graph. St001957The number of Hasse diagrams with a given underlying undirected graph. St000389The number of runs of ones of odd length in a binary word. St001642The Prague dimension of a graph. St001884The number of borders of a binary word. St000762The sum of the positions of the weak records of an integer composition. St000481The number of upper covers of a partition in dominance order. St001432The order dimension of the partition. St000256The number of parts from which one can substract 2 and still get an integer partition. St000319The spin of an integer partition. St000320The dinv adjustment of an integer partition. St000480The number of lower covers of a partition in dominance order. St000714The number of semistandard Young tableau of given shape, with entries at most 2. St000143The largest repeated part of a partition. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St001323The independence gap of a graph. St001578The minimal number of edges to add or remove to make a graph a line graph. St001282The number of graphs with the same chromatic polynomial. St001352The number of internal nodes in the modular decomposition of a graph. St001704The size of the largest multi-subset-intersection of the deck of a graph with the deck of another graph. St001345The Hamming dimension of a graph. St001001The number of indecomposable modules with projective and injective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. St001871The number of triconnected components of a graph. St001236The dominant dimension of the corresponding Comp-Nakayama algebra. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001200The number of simple modules in $eAe$ with projective dimension at most 2 in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001487The number of inner corners of a skew partition. St000455The second largest eigenvalue of a graph if it is integral. St000422The energy of a graph, if it is integral. St000699The toughness times the least common multiple of 1,. St000718The largest Laplacian eigenvalue of a graph if it is integral. St001281The normalized isoperimetric number of a graph. St001592The maximal number of simple paths between any two different vertices of a graph. St000741The Colin de Verdière graph invariant. St000205Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and partition weight. St000206Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and integer composition weight. St001103The number of words with multiplicities of the letters given by the partition, avoiding the consecutive pattern 123. St001442The number of standard Young tableaux whose major index is divisible by the size of a given integer partition. St001562The value of the complete homogeneous symmetric function evaluated at 1. St001563The value of the power-sum symmetric function evaluated at 1. St001564The value of the forgotten symmetric functions when all variables set to 1. St000644The number of graphs with given frequency partition. St001613The binary logarithm of the size of the center of a lattice. St001615The number of join prime elements of a lattice. St001617The dimension of the space of valuations of a lattice. St001621The number of atoms of a lattice. St001622The number of join-irreducible elements of a lattice. St001623The number of doubly irreducible elements of a lattice. St001626The number of maximal proper sublattices of a lattice. St001677The number of non-degenerate subsets of a lattice whose meet is the bottom element. St001845The number of join irreducibles minus the rank of a lattice. St001846The number of elements which do not have a complement in the lattice. St000088The row sums of the character table of the symmetric group. St000207Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer composition weight. St000208Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer partition weight. St000550The number of modular elements of a lattice. St000551The number of left modular elements of a lattice. St001616The number of neutral elements in a lattice. St001618The cardinality of the Frattini sublattice of a lattice. St001624The breadth of a lattice. St001625The Möbius invariant of a lattice. St001679The number of subsets of a lattice whose meet is the bottom element. St001681The number of inclusion-wise minimal subsets of a lattice, whose meet is the bottom element. St001711The number of permutations such that conjugation with a permutation of given cycle type yields the squared permutation. St001719The number of shortest chains of small intervals from the bottom to the top in a lattice. St001720The minimal length of a chain of small intervals in a lattice. St001754The number of tolerances of a finite lattice. St001820The size of the image of the pop stack sorting operator. St001833The number of linear intervals in a lattice. St001881The number of factors of a lattice as a Cartesian product of lattices. St001934The number of monotone factorisations of genus zero of a permutation of given cycle type. St001619The number of non-isomorphic sublattices of a lattice. St001620The number of sublattices of a lattice. St001666The number of non-isomorphic subposets of a lattice which are lattices. St001364The number of permutations whose cube equals a fixed permutation of given cycle type. St000658The number of rises of length 2 of a Dyck path. St001703The villainy of a graph. St000689The maximal n such that the minimal generator-cogenerator module in the LNakayama algebra of a Dyck path is n-rigid. St001314The number of tilting modules of arbitrary projective dimension that have no simple modules as a direct summand in the corresponding Nakayama algebra. St001545The second Elser number of a connected graph. St001000Number of indecomposable modules with projective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001195The global dimension of the algebra $A/AfA$ of the corresponding Nakayama algebra $A$ with minimal left faithful projective-injective module $Af$. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St001514The dimension of the top of the Auslander-Reiten translate of the regular modules as a bimodule. St000929The constant term of the character polynomial of an integer partition. St001812The biclique partition number of a graph. St001651The Frankl number of a lattice. St001630The global dimension of the incidence algebra of the lattice over the rational numbers. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St001875The number of simple modules with projective dimension at most 1. St001877Number of indecomposable injective modules with projective dimension 2. St001645The pebbling number of a connected graph. St000479The Ramsey number of a graph. St001256Number of simple reflexive modules that are 2-stable reflexive. St001204Call a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series $L=[c_0,c_1,...,c_{n−1}]$ such that $n=c_0 < c_i$ for all $i > 0$ a special CNakayama algebra. St000749The smallest integer d such that the restriction of the representation corresponding to a partition of n to the symmetric group on n-d letters has a constituent of odd degree. St001175The size of a partition minus the hook length of the base cell. St001248Sum of the even parts of a partition. St001586The number of odd parts smaller than the largest even part in an integer partition. St001587Half of the largest even part of an integer partition. St001657The number of twos in an integer partition. St000618The number of self-evacuating tableaux of given shape. St000755The number of real roots of the characteristic polynomial of a linear recurrence associated with an integer partition. St000781The number of proper colouring schemes of a Ferrers diagram. St001901The largest multiplicity of an irreducible representation contained in the higher Lie character for an integer partition. St000264The girth of a graph, which is not a tree. St000456The monochromatic index of a connected graph. St001118The acyclic chromatic index of a graph. St000464The Schultz index of a connected graph. St000475The number of parts equal to 1 in a partition. St001695The natural comajor index of a standard Young tableau. St001698The comajor index of a standard tableau minus the weighted size of its shape. St001699The major index of a standard tableau minus the weighted size of its shape. St001712The number of natural descents of a standard Young tableau. St000068The number of minimal elements in a poset. St001060The distinguishing index of a graph. St000454The largest eigenvalue of a graph if it is integral. St001568The smallest positive integer that does not appear twice in the partition. St001890The maximum magnitude of the Möbius function of a poset. St000221The number of strong fixed points of a permutation. St000279The size of the preimage of the map 'cycle-as-one-line notation' from Permutations to Permutations. St000375The number of non weak exceedences of a permutation that are mid-points of a decreasing subsequence of length $3$. St000488The number of cycles of a permutation of length at most 2. St000489The number of cycles of a permutation of length at most 3. St000623The number of occurrences of the pattern 52341 in a permutation. St000666The number of right tethers of a permutation. St000787The number of flips required to make a perfect matching noncrossing. St000879The number of long braid edges in the graph of braid moves of a permutation. St001059Number of occurrences of the patterns 41352,42351,51342,52341 in a permutation. St001292The injective dimension of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. St001381The fertility of a permutation. St001444The rank of the skew-symmetric form which is non-zero on crossing arcs of a perfect matching. St001466The number of transpositions swapping cyclically adjacent numbers in a permutation. St001549The number of restricted non-inversions between exceedances. St001551The number of restricted non-inversions between exceedances where the rightmost exceedance is linked. St001552The number of inversions between excedances and fixed points of a permutation. St001663The number of occurrences of the Hertzsprung pattern 132 in a permutation. St001810The number of fixed points of a permutation smaller than its largest moved point. St001811The Castelnuovo-Mumford regularity of a permutation. St001837The number of occurrences of a 312 pattern in the restricted growth word of a perfect matching. St001850The number of Hecke atoms of a permutation. St001906Half of the difference between the total displacement and the number of inversions and the reflection length of a permutation. St000056The decomposition (or block) number of a permutation. St000069The number of maximal elements of a poset. St000162The number of nontrivial cycles in the cycle decomposition of a permutation. St000486The number of cycles of length at least 3 of a permutation. St000694The number of affine bounded permutations that project to a given permutation. St000788The number of nesting-similar perfect matchings of a perfect matching. St000882The number of connected components of short braid edges in the graph of braid moves of a permutation. St001081The number of minimal length factorizations of a permutation into star transpositions. St001174The Gorenstein dimension of the algebra $A/I$ when $I$ is the tilting module corresponding to the permutation in the Auslander algebra of $K[x]/(x^n)$. St001208The number of connected components of the quiver of $A/T$ when $T$ is the 1-tilting module corresponding to the permutation in the Auslander algebra $A$ of $K[x]/(x^n)$. St001461The number of topologically connected components of the chord diagram of a permutation. St001493The number of simple modules with maximal even projective dimension in the corresponding Nakayama algebra. St001507The sum of projective dimension of simple modules with even projective dimension divided by 2 in the LNakayama algebra corresponding to Dyck paths. St001590The crossing number of a perfect matching. St001661Half the permanent of the Identity matrix plus the permutation matrix associated to the permutation. St001830The chord expansion number of a perfect matching. St001832The number of non-crossing perfect matchings in the chord expansion of a perfect matching. St001859The number of factors of the Stanley symmetric function associated with a permutation. St001165Number of simple modules with even projective dimension in the corresponding Nakayama algebra. St001359The number of permutations in the equivalence class of a permutation obtained by taking inverses of cycles. St001603The number of colourings of a polygon such that the multiplicities of a colour are given by a partition. St001305The number of induced cycles on four vertices in a graph. St001326The minimal number of occurrences of the interval-pattern in a linear ordering of the vertices of the graph. St001367The smallest number which does not occur as degree of a vertex in a graph. St001876The number of 2-regular simple modules in the incidence algebra of the lattice. St001363The Euler characteristic of a graph according to Knill. St001496The number of graphs with the same Laplacian spectrum as the given graph. St001301The first Betti number of the order complex associated with the poset. St000181The number of connected components of the Hasse diagram for the poset. St000908The length of the shortest maximal antichain in a poset. St001634The trace of the Coxeter matrix of the incidence algebra of a poset.