Your data matches 187 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St001793
(load all 18 compositions to match this statistic)
Mapping
Mp00250: Graphs —clique graph⟶ Graphs
St001793: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 0
([(1,3),(2,3)],4)
 => ([(1,2)],3)
 => 0
([(0,3),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(1,2)],3)
 => 0
([(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1)],2)
 => 0
([(0,2),(0,3),(1,2),(1,3)],4)
 => ([(0,2),(0,3),(1,2),(1,3)],4)
 => 0
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1)],2)
 => 0
([(2,4),(3,4)],5)
 => ([(2,3)],4)
 => 0
([(1,4),(2,4),(3,4)],5)
 => ([(1,2),(1,3),(2,3)],4)
 => 0
([(0,4),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 0
([(1,4),(2,3),(3,4)],5)
 => ([(1,3),(2,3)],4)
 => 0
([(0,1),(2,4),(3,4)],5)
 => ([(1,2)],3)
 => 0
([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(0,3),(1,2),(1,3),(2,3)],4)
 => 0
([(1,4),(2,3),(2,4),(3,4)],5)
 => ([(1,2)],3)
 => 0
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
([(1,3),(1,4),(2,3),(2,4)],5)
 => ([(1,3),(1,4),(2,3),(2,4)],5)
 => 0
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
 => ([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => 0
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(1,2)],3)
 => 0
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,2),(1,2)],3)
 => 0
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,3),(0,4),(0,5),(1,2),(1,4),(1,5),(2,3),(2,5),(3,4)],6)
 => 0
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => 0
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(0,2),(1,2)],3)
 => 0
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => 0
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,2),(0,3),(1,2),(1,3)],4)
 => 0
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,2),(1,2)],3)
 => 0
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => 0
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => 0
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,2),(0,3),(1,2),(1,3)],4)
 => 0
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 0
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => 0
([(3,5),(4,5)],6)
 => ([(3,4)],5)
 => 0
([(2,5),(3,5),(4,5)],6)
 => ([(2,3),(2,4),(3,4)],5)
 => 0
([(1,5),(2,5),(3,5),(4,5)],6)
 => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 0
([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 0
([(2,5),(3,4),(4,5)],6)
 => ([(2,4),(3,4)],5)
 => 0
([(1,2),(3,5),(4,5)],6)
 => ([(2,3)],4)
 => 0
([(1,5),(2,5),(3,4),(4,5)],6)
 => ([(1,4),(2,3),(2,4),(3,4)],5)
 => 0
([(0,1),(2,5),(3,5),(4,5)],6)
 => ([(1,2),(1,3),(2,3)],4)
 => 0
([(2,5),(3,4),(3,5),(4,5)],6)
 => ([(2,3)],4)
 => 0
([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
 => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 0
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(1,2),(1,3),(2,3)],4)
 => 0
([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 0
([(2,4),(2,5),(3,4),(3,5)],6)
 => ([(2,4),(2,5),(3,4),(3,5)],6)
 => 0
([(0,5),(1,5),(2,4),(3,4)],6)
 => ([(0,3),(1,2)],4)
 => 0
([(1,5),(2,3),(2,4),(3,5),(4,5)],6)
 => ([(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
 => 0
([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
 => ([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
 => 0
Description
The difference between the clique number and the chromatic number of a graph. A graph whose clique number and chromatic number coincide are called weakly perfect.
Matching statistic: St001324
(load all 5 compositions to match this statistic)
Mapping
Mp00250: Graphs —clique graph⟶ Graphs
Mp00154: Graphs —core⟶ Graphs
St001324: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 0
([(1,3),(2,3)],4)
 => ([(1,2)],3)
 => ([(0,1)],2)
 => 0
([(0,3),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 0
([(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 0
([(0,2),(0,3),(1,2),(1,3)],4)
 => ([(0,2),(0,3),(1,2),(1,3)],4)
 => ([(0,1)],2)
 => 0
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 0
([(2,4),(3,4)],5)
 => ([(2,3)],4)
 => ([(0,1)],2)
 => 0
([(1,4),(2,4),(3,4)],5)
 => ([(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
([(0,4),(1,4),(2,4),(3,4)],5)
 => ([(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)
 => 0
([(1,4),(2,3),(3,4)],5)
 => ([(1,3),(2,3)],4)
 => ([(0,1)],2)
 => 0
([(0,1),(2,4),(3,4)],5)
 => ([(1,2)],3)
 => ([(0,1)],2)
 => 0
([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
([(1,4),(2,3),(2,4),(3,4)],5)
 => ([(1,2)],3)
 => ([(0,1)],2)
 => 0
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
([(1,3),(1,4),(2,3),(2,4)],5)
 => ([(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,1)],2)
 => 0
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
 => ([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(1,2)],3)
 => ([(0,1)],2)
 => 0
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 0
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,3),(0,4),(0,5),(1,2),(1,4),(1,5),(2,3),(2,5),(3,4)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,1)],2)
 => 0
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 0
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 0
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,2),(0,3),(1,2),(1,3)],4)
 => ([(0,1)],2)
 => 0
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 0
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 0
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 0
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,2),(0,3),(1,2),(1,3)],4)
 => ([(0,1)],2)
 => 0
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
 => ([(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)
 => 0
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 0
([(3,5),(4,5)],6)
 => ([(3,4)],5)
 => ([(0,1)],2)
 => 0
([(2,5),(3,5),(4,5)],6)
 => ([(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
([(1,5),(2,5),(3,5),(4,5)],6)
 => ([(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)
 => 0
([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(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)
 => 0
([(2,5),(3,4),(4,5)],6)
 => ([(2,4),(3,4)],5)
 => ([(0,1)],2)
 => 0
([(1,2),(3,5),(4,5)],6)
 => ([(2,3)],4)
 => ([(0,1)],2)
 => 0
([(1,5),(2,5),(3,4),(4,5)],6)
 => ([(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
([(0,1),(2,5),(3,5),(4,5)],6)
 => ([(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
([(2,5),(3,4),(3,5),(4,5)],6)
 => ([(2,3)],4)
 => ([(0,1)],2)
 => 0
([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
 => ([(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)
 => 0
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(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)
 => 0
([(2,4),(2,5),(3,4),(3,5)],6)
 => ([(2,4),(2,5),(3,4),(3,5)],6)
 => ([(0,1)],2)
 => 0
([(0,5),(1,5),(2,4),(3,4)],6)
 => ([(0,3),(1,2)],4)
 => ([(0,1)],2)
 => 0
([(1,5),(2,3),(2,4),(3,5),(4,5)],6)
 => ([(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
 => ([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
Description
The minimal number of occurrences of the chordal-pattern in a linear ordering of the vertices of the graph. A graph is chordal if and only if in any linear ordering of its vertices, there are no three vertices $a < b < c$ such that $(a,c)$ and $(b,c)$ are edges and $(a,b)$ is not an edge. This statistic is the minimal number of occurrences of this pattern, in the set of all linear orderings of the vertices.
Matching statistic: St001325
(load all 8 compositions to match this statistic)
Mapping
Mp00250: Graphs —clique graph⟶ Graphs
Mp00154: Graphs —core⟶ Graphs
St001325: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 0
([(1,3),(2,3)],4)
 => ([(1,2)],3)
 => ([(0,1)],2)
 => 0
([(0,3),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 0
([(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 0
([(0,2),(0,3),(1,2),(1,3)],4)
 => ([(0,2),(0,3),(1,2),(1,3)],4)
 => ([(0,1)],2)
 => 0
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 0
([(2,4),(3,4)],5)
 => ([(2,3)],4)
 => ([(0,1)],2)
 => 0
([(1,4),(2,4),(3,4)],5)
 => ([(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
([(0,4),(1,4),(2,4),(3,4)],5)
 => ([(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)
 => 0
([(1,4),(2,3),(3,4)],5)
 => ([(1,3),(2,3)],4)
 => ([(0,1)],2)
 => 0
([(0,1),(2,4),(3,4)],5)
 => ([(1,2)],3)
 => ([(0,1)],2)
 => 0
([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
([(1,4),(2,3),(2,4),(3,4)],5)
 => ([(1,2)],3)
 => ([(0,1)],2)
 => 0
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
([(1,3),(1,4),(2,3),(2,4)],5)
 => ([(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,1)],2)
 => 0
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
 => ([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(1,2)],3)
 => ([(0,1)],2)
 => 0
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 0
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,3),(0,4),(0,5),(1,2),(1,4),(1,5),(2,3),(2,5),(3,4)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,1)],2)
 => 0
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 0
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 0
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,2),(0,3),(1,2),(1,3)],4)
 => ([(0,1)],2)
 => 0
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 0
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 0
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 0
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,2),(0,3),(1,2),(1,3)],4)
 => ([(0,1)],2)
 => 0
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
 => ([(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)
 => 0
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 0
([(3,5),(4,5)],6)
 => ([(3,4)],5)
 => ([(0,1)],2)
 => 0
([(2,5),(3,5),(4,5)],6)
 => ([(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
([(1,5),(2,5),(3,5),(4,5)],6)
 => ([(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)
 => 0
([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(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)
 => 0
([(2,5),(3,4),(4,5)],6)
 => ([(2,4),(3,4)],5)
 => ([(0,1)],2)
 => 0
([(1,2),(3,5),(4,5)],6)
 => ([(2,3)],4)
 => ([(0,1)],2)
 => 0
([(1,5),(2,5),(3,4),(4,5)],6)
 => ([(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
([(0,1),(2,5),(3,5),(4,5)],6)
 => ([(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
([(2,5),(3,4),(3,5),(4,5)],6)
 => ([(2,3)],4)
 => ([(0,1)],2)
 => 0
([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
 => ([(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)
 => 0
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(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)
 => 0
([(2,4),(2,5),(3,4),(3,5)],6)
 => ([(2,4),(2,5),(3,4),(3,5)],6)
 => ([(0,1)],2)
 => 0
([(0,5),(1,5),(2,4),(3,4)],6)
 => ([(0,3),(1,2)],4)
 => ([(0,1)],2)
 => 0
([(1,5),(2,3),(2,4),(3,5),(4,5)],6)
 => ([(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
 => ([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
Description
The minimal number of occurrences of the comparability-pattern in a linear ordering of the vertices of the graph. A graph is a comparability graph if and only if in any linear ordering of its vertices, there are no three vertices $a < b < c$ such that $(a,b)$ and $(b,c)$ are edges and $(a,c)$ is not an edge. This statistic is the minimal number of occurrences of this pattern, in the set of all linear orderings of the vertices.
Matching statistic: St001353
(load all 5 compositions to match this statistic)
Mapping
Mp00250: Graphs —clique graph⟶ Graphs
Mp00154: Graphs —core⟶ Graphs
St001353: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 0
([(1,3),(2,3)],4)
 => ([(1,2)],3)
 => ([(0,1)],2)
 => 0
([(0,3),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 0
([(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 0
([(0,2),(0,3),(1,2),(1,3)],4)
 => ([(0,2),(0,3),(1,2),(1,3)],4)
 => ([(0,1)],2)
 => 0
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 0
([(2,4),(3,4)],5)
 => ([(2,3)],4)
 => ([(0,1)],2)
 => 0
([(1,4),(2,4),(3,4)],5)
 => ([(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
([(0,4),(1,4),(2,4),(3,4)],5)
 => ([(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)
 => 0
([(1,4),(2,3),(3,4)],5)
 => ([(1,3),(2,3)],4)
 => ([(0,1)],2)
 => 0
([(0,1),(2,4),(3,4)],5)
 => ([(1,2)],3)
 => ([(0,1)],2)
 => 0
([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
([(1,4),(2,3),(2,4),(3,4)],5)
 => ([(1,2)],3)
 => ([(0,1)],2)
 => 0
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
([(1,3),(1,4),(2,3),(2,4)],5)
 => ([(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,1)],2)
 => 0
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
 => ([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(1,2)],3)
 => ([(0,1)],2)
 => 0
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 0
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,3),(0,4),(0,5),(1,2),(1,4),(1,5),(2,3),(2,5),(3,4)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,1)],2)
 => 0
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 0
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 0
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,2),(0,3),(1,2),(1,3)],4)
 => ([(0,1)],2)
 => 0
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 0
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 0
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 0
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,2),(0,3),(1,2),(1,3)],4)
 => ([(0,1)],2)
 => 0
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
 => ([(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)
 => 0
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 0
([(3,5),(4,5)],6)
 => ([(3,4)],5)
 => ([(0,1)],2)
 => 0
([(2,5),(3,5),(4,5)],6)
 => ([(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
([(1,5),(2,5),(3,5),(4,5)],6)
 => ([(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)
 => 0
([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(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)
 => 0
([(2,5),(3,4),(4,5)],6)
 => ([(2,4),(3,4)],5)
 => ([(0,1)],2)
 => 0
([(1,2),(3,5),(4,5)],6)
 => ([(2,3)],4)
 => ([(0,1)],2)
 => 0
([(1,5),(2,5),(3,4),(4,5)],6)
 => ([(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
([(0,1),(2,5),(3,5),(4,5)],6)
 => ([(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
([(2,5),(3,4),(3,5),(4,5)],6)
 => ([(2,3)],4)
 => ([(0,1)],2)
 => 0
([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
 => ([(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)
 => 0
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(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)
 => 0
([(2,4),(2,5),(3,4),(3,5)],6)
 => ([(2,4),(2,5),(3,4),(3,5)],6)
 => ([(0,1)],2)
 => 0
([(0,5),(1,5),(2,4),(3,4)],6)
 => ([(0,3),(1,2)],4)
 => ([(0,1)],2)
 => 0
([(1,5),(2,3),(2,4),(3,5),(4,5)],6)
 => ([(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
 => ([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
Description
The number of prime nodes in the modular decomposition of a graph.
Matching statistic: St001798
(load all 5 compositions to match this statistic)
Mapping
Mp00250: Graphs —clique graph⟶ Graphs
Mp00154: Graphs —core⟶ Graphs
St001798: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 0
([(1,3),(2,3)],4)
 => ([(1,2)],3)
 => ([(0,1)],2)
 => 0
([(0,3),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 0
([(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 0
([(0,2),(0,3),(1,2),(1,3)],4)
 => ([(0,2),(0,3),(1,2),(1,3)],4)
 => ([(0,1)],2)
 => 0
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 0
([(2,4),(3,4)],5)
 => ([(2,3)],4)
 => ([(0,1)],2)
 => 0
([(1,4),(2,4),(3,4)],5)
 => ([(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
([(0,4),(1,4),(2,4),(3,4)],5)
 => ([(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)
 => 0
([(1,4),(2,3),(3,4)],5)
 => ([(1,3),(2,3)],4)
 => ([(0,1)],2)
 => 0
([(0,1),(2,4),(3,4)],5)
 => ([(1,2)],3)
 => ([(0,1)],2)
 => 0
([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
([(1,4),(2,3),(2,4),(3,4)],5)
 => ([(1,2)],3)
 => ([(0,1)],2)
 => 0
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
([(1,3),(1,4),(2,3),(2,4)],5)
 => ([(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,1)],2)
 => 0
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
 => ([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(1,2)],3)
 => ([(0,1)],2)
 => 0
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 0
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,3),(0,4),(0,5),(1,2),(1,4),(1,5),(2,3),(2,5),(3,4)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,1)],2)
 => 0
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 0
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 0
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,2),(0,3),(1,2),(1,3)],4)
 => ([(0,1)],2)
 => 0
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 0
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 0
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 0
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,2),(0,3),(1,2),(1,3)],4)
 => ([(0,1)],2)
 => 0
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
 => ([(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)
 => 0
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 0
([(3,5),(4,5)],6)
 => ([(3,4)],5)
 => ([(0,1)],2)
 => 0
([(2,5),(3,5),(4,5)],6)
 => ([(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
([(1,5),(2,5),(3,5),(4,5)],6)
 => ([(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)
 => 0
([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(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)
 => 0
([(2,5),(3,4),(4,5)],6)
 => ([(2,4),(3,4)],5)
 => ([(0,1)],2)
 => 0
([(1,2),(3,5),(4,5)],6)
 => ([(2,3)],4)
 => ([(0,1)],2)
 => 0
([(1,5),(2,5),(3,4),(4,5)],6)
 => ([(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
([(0,1),(2,5),(3,5),(4,5)],6)
 => ([(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
([(2,5),(3,4),(3,5),(4,5)],6)
 => ([(2,3)],4)
 => ([(0,1)],2)
 => 0
([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
 => ([(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)
 => 0
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(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)
 => 0
([(2,4),(2,5),(3,4),(3,5)],6)
 => ([(2,4),(2,5),(3,4),(3,5)],6)
 => ([(0,1)],2)
 => 0
([(0,5),(1,5),(2,4),(3,4)],6)
 => ([(0,3),(1,2)],4)
 => ([(0,1)],2)
 => 0
([(1,5),(2,3),(2,4),(3,5),(4,5)],6)
 => ([(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
 => ([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 0
Description
The difference of the number of edges in a graph and the number of edges in the complement of the Turán graph. Let $n(G)$ be the number of vertices of a graph $G$, $m(G)$ be its number of edges and let $\alpha(G)$ be its independence number, [[St000093]]. Turán's theorem is that $m(G) \geq m(T^c(n(G), \alpha(G)))$ where $T^c(n, r)$ is the complement of the Turán graph. This statistic records the difference.
Matching statistic: St000093
(load all 3 compositions to match this statistic)
Mapping
Mp00250: Graphs —clique graph⟶ Graphs
Mp00154: Graphs —core⟶ Graphs
St000093: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(1,3),(2,3)],4)
 => ([(1,2)],3)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,3),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,2),(0,3),(1,2),(1,3)],4)
 => ([(0,2),(0,3),(1,2),(1,3)],4)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(2,4),(3,4)],5)
 => ([(2,3)],4)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(1,4),(2,4),(3,4)],5)
 => ([(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(1,4),(2,4),(3,4)],5)
 => ([(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
([(1,4),(2,3),(3,4)],5)
 => ([(1,3),(2,3)],4)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,1),(2,4),(3,4)],5)
 => ([(1,2)],3)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,4),(2,3),(2,4),(3,4)],5)
 => ([(1,2)],3)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,3),(1,4),(2,3),(2,4)],5)
 => ([(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
 => ([(0,1),(0,4),(1,3),(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)
 => ([(1,2)],3)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,3),(0,4),(0,5),(1,2),(1,4),(1,5),(2,3),(2,5),(3,4)],6)
 => ([(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)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 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)
 => ([(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,2),(0,3),(1,2),(1,3)],4)
 => ([(0,1)],2)
 => 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)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,2),(0,3),(1,2),(1,3)],4)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
 => ([(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
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(3,5),(4,5)],6)
 => ([(3,4)],5)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(2,5),(3,5),(4,5)],6)
 => ([(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,5),(2,5),(3,5),(4,5)],6)
 => ([(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,5),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(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
([(2,5),(3,4),(4,5)],6)
 => ([(2,4),(3,4)],5)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(1,2),(3,5),(4,5)],6)
 => ([(2,3)],4)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(1,5),(2,5),(3,4),(4,5)],6)
 => ([(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,1),(2,5),(3,5),(4,5)],6)
 => ([(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(2,5),(3,4),(3,5),(4,5)],6)
 => ([(2,3)],4)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
 => ([(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
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(1,2),(1,3),(2,3)],4)
 => ([(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),(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,4),(2,5),(3,4),(3,5)],6)
 => ([(2,4),(2,5),(3,4),(3,5)],6)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,5),(1,5),(2,4),(3,4)],6)
 => ([(0,3),(1,2)],4)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(1,5),(2,3),(2,4),(3,5),(4,5)],6)
 => ([(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,5),(2,3),(3,4),(4,5)],6)
 => ([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
Description
The cardinality of a maximal independent set of vertices of a graph. An independent set of a graph is a set of pairwise non-adjacent vertices. A maximum independent set is an independent set of maximum cardinality. This statistic is also called the independence number or stability number $\alpha(G)$ of $G$.
Matching statistic: St000259
(load all 3 compositions to match this statistic)
Mapping
Mp00250: Graphs —clique graph⟶ Graphs
Mp00154: Graphs —core⟶ Graphs
St000259: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(1,3),(2,3)],4)
 => ([(1,2)],3)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,3),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,2),(0,3),(1,2),(1,3)],4)
 => ([(0,2),(0,3),(1,2),(1,3)],4)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(2,4),(3,4)],5)
 => ([(2,3)],4)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(1,4),(2,4),(3,4)],5)
 => ([(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(1,4),(2,4),(3,4)],5)
 => ([(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
([(1,4),(2,3),(3,4)],5)
 => ([(1,3),(2,3)],4)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,1),(2,4),(3,4)],5)
 => ([(1,2)],3)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,4),(2,3),(2,4),(3,4)],5)
 => ([(1,2)],3)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,3),(1,4),(2,3),(2,4)],5)
 => ([(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
 => ([(0,1),(0,4),(1,3),(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)
 => ([(1,2)],3)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,3),(0,4),(0,5),(1,2),(1,4),(1,5),(2,3),(2,5),(3,4)],6)
 => ([(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)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 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)
 => ([(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,2),(0,3),(1,2),(1,3)],4)
 => ([(0,1)],2)
 => 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)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,2),(0,3),(1,2),(1,3)],4)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
 => ([(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
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(3,5),(4,5)],6)
 => ([(3,4)],5)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(2,5),(3,5),(4,5)],6)
 => ([(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,5),(2,5),(3,5),(4,5)],6)
 => ([(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,5),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(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
([(2,5),(3,4),(4,5)],6)
 => ([(2,4),(3,4)],5)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(1,2),(3,5),(4,5)],6)
 => ([(2,3)],4)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(1,5),(2,5),(3,4),(4,5)],6)
 => ([(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,1),(2,5),(3,5),(4,5)],6)
 => ([(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(2,5),(3,4),(3,5),(4,5)],6)
 => ([(2,3)],4)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
 => ([(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
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(1,2),(1,3),(2,3)],4)
 => ([(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),(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,4),(2,5),(3,4),(3,5)],6)
 => ([(2,4),(2,5),(3,4),(3,5)],6)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,5),(1,5),(2,4),(3,4)],6)
 => ([(0,3),(1,2)],4)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(1,5),(2,3),(2,4),(3,5),(4,5)],6)
 => ([(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,5),(2,3),(3,4),(4,5)],6)
 => ([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
Description
The diameter of a connected graph. This is the greatest distance between any pair of vertices.
Matching statistic: St000260
(load all 3 compositions to match this statistic)
Mapping
Mp00250: Graphs —clique graph⟶ Graphs
Mp00154: Graphs —core⟶ Graphs
St000260: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(1,3),(2,3)],4)
 => ([(1,2)],3)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,3),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,2),(0,3),(1,2),(1,3)],4)
 => ([(0,2),(0,3),(1,2),(1,3)],4)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(2,4),(3,4)],5)
 => ([(2,3)],4)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(1,4),(2,4),(3,4)],5)
 => ([(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(1,4),(2,4),(3,4)],5)
 => ([(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
([(1,4),(2,3),(3,4)],5)
 => ([(1,3),(2,3)],4)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,1),(2,4),(3,4)],5)
 => ([(1,2)],3)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,4),(2,3),(2,4),(3,4)],5)
 => ([(1,2)],3)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,3),(1,4),(2,3),(2,4)],5)
 => ([(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
 => ([(0,1),(0,4),(1,3),(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)
 => ([(1,2)],3)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,3),(0,4),(0,5),(1,2),(1,4),(1,5),(2,3),(2,5),(3,4)],6)
 => ([(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)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 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)
 => ([(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,2),(0,3),(1,2),(1,3)],4)
 => ([(0,1)],2)
 => 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)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,2),(0,3),(1,2),(1,3)],4)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
 => ([(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
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(3,5),(4,5)],6)
 => ([(3,4)],5)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(2,5),(3,5),(4,5)],6)
 => ([(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,5),(2,5),(3,5),(4,5)],6)
 => ([(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,5),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(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
([(2,5),(3,4),(4,5)],6)
 => ([(2,4),(3,4)],5)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(1,2),(3,5),(4,5)],6)
 => ([(2,3)],4)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(1,5),(2,5),(3,4),(4,5)],6)
 => ([(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,1),(2,5),(3,5),(4,5)],6)
 => ([(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(2,5),(3,4),(3,5),(4,5)],6)
 => ([(2,3)],4)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
 => ([(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
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(1,2),(1,3),(2,3)],4)
 => ([(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),(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,4),(2,5),(3,4),(3,5)],6)
 => ([(2,4),(2,5),(3,4),(3,5)],6)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,5),(1,5),(2,4),(3,4)],6)
 => ([(0,3),(1,2)],4)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(1,5),(2,3),(2,4),(3,5),(4,5)],6)
 => ([(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,5),(2,3),(3,4),(4,5)],6)
 => ([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(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 3 compositions to match this statistic)
Mapping
Mp00250: Graphs —clique graph⟶ Graphs
Mp00154: Graphs —core⟶ Graphs
St000273: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(1,3),(2,3)],4)
 => ([(1,2)],3)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,3),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,2),(0,3),(1,2),(1,3)],4)
 => ([(0,2),(0,3),(1,2),(1,3)],4)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(2,4),(3,4)],5)
 => ([(2,3)],4)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(1,4),(2,4),(3,4)],5)
 => ([(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(1,4),(2,4),(3,4)],5)
 => ([(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
([(1,4),(2,3),(3,4)],5)
 => ([(1,3),(2,3)],4)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,1),(2,4),(3,4)],5)
 => ([(1,2)],3)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,4),(2,3),(2,4),(3,4)],5)
 => ([(1,2)],3)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,3),(1,4),(2,3),(2,4)],5)
 => ([(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
 => ([(0,1),(0,4),(1,3),(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)
 => ([(1,2)],3)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,3),(0,4),(0,5),(1,2),(1,4),(1,5),(2,3),(2,5),(3,4)],6)
 => ([(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)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 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)
 => ([(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,2),(0,3),(1,2),(1,3)],4)
 => ([(0,1)],2)
 => 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)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,2),(0,3),(1,2),(1,3)],4)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
 => ([(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
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(3,5),(4,5)],6)
 => ([(3,4)],5)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(2,5),(3,5),(4,5)],6)
 => ([(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,5),(2,5),(3,5),(4,5)],6)
 => ([(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,5),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(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
([(2,5),(3,4),(4,5)],6)
 => ([(2,4),(3,4)],5)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(1,2),(3,5),(4,5)],6)
 => ([(2,3)],4)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(1,5),(2,5),(3,4),(4,5)],6)
 => ([(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,1),(2,5),(3,5),(4,5)],6)
 => ([(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(2,5),(3,4),(3,5),(4,5)],6)
 => ([(2,3)],4)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
 => ([(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
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(1,2),(1,3),(2,3)],4)
 => ([(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),(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,4),(2,5),(3,4),(3,5)],6)
 => ([(2,4),(2,5),(3,4),(3,5)],6)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,5),(1,5),(2,4),(3,4)],6)
 => ([(0,3),(1,2)],4)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(1,5),(2,3),(2,4),(3,5),(4,5)],6)
 => ([(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,5),(2,3),(3,4),(4,5)],6)
 => ([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(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: St000535
(load all 3 compositions to match this statistic)
Mapping
Mp00250: Graphs —clique graph⟶ Graphs
Mp00154: Graphs —core⟶ Graphs
St000535: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(1,3),(2,3)],4)
 => ([(1,2)],3)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,3),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(1,2),(2,3)],4)
 => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,2),(0,3),(1,2),(1,3)],4)
 => ([(0,2),(0,3),(1,2),(1,3)],4)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(2,4),(3,4)],5)
 => ([(2,3)],4)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(1,4),(2,4),(3,4)],5)
 => ([(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(1,4),(2,4),(3,4)],5)
 => ([(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
([(1,4),(2,3),(3,4)],5)
 => ([(1,3),(2,3)],4)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,1),(2,4),(3,4)],5)
 => ([(1,2)],3)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,4),(1,4),(2,3),(3,4)],5)
 => ([(0,3),(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,4),(2,3),(2,4),(3,4)],5)
 => ([(1,2)],3)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,3),(1,4),(2,3),(2,4)],5)
 => ([(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
 => ([(0,1),(0,4),(1,3),(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)
 => ([(1,2)],3)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,3),(0,4),(0,5),(1,2),(1,4),(1,5),(2,3),(2,5),(3,4)],6)
 => ([(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)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(1,3),(2,3),(2,4)],5)
 => ([(0,3),(1,2),(2,3)],4)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 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)
 => ([(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,2),(0,3),(1,2),(1,3)],4)
 => ([(0,1)],2)
 => 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)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
 => ([(0,2),(1,2)],3)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
 => ([(0,2),(0,3),(1,2),(1,3)],4)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
 => ([(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
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1)],2)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(3,5),(4,5)],6)
 => ([(3,4)],5)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(2,5),(3,5),(4,5)],6)
 => ([(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(1,5),(2,5),(3,5),(4,5)],6)
 => ([(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,5),(1,5),(2,5),(3,5),(4,5)],6)
 => ([(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
([(2,5),(3,4),(4,5)],6)
 => ([(2,4),(3,4)],5)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(1,2),(3,5),(4,5)],6)
 => ([(2,3)],4)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(1,5),(2,5),(3,4),(4,5)],6)
 => ([(1,4),(2,3),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(0,1),(2,5),(3,5),(4,5)],6)
 => ([(1,2),(1,3),(2,3)],4)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
([(2,5),(3,4),(3,5),(4,5)],6)
 => ([(2,3)],4)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
 => ([(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
([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
 => ([(1,2),(1,3),(2,3)],4)
 => ([(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),(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,4),(2,5),(3,4),(3,5)],6)
 => ([(2,4),(2,5),(3,4),(3,5)],6)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(0,5),(1,5),(2,4),(3,4)],6)
 => ([(0,3),(1,2)],4)
 => ([(0,1)],2)
 => 1 = 0 + 1
([(1,5),(2,3),(2,4),(3,5),(4,5)],6)
 => ([(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,5),(2,3),(3,4),(4,5)],6)
 => ([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
 => ([(0,1),(0,2),(1,2)],3)
 => 1 = 0 + 1
Description
The rank-width of a graph.
The following 177 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000544The cop number of a graph. St000786The maximal number of occurrences of a colour in a proper colouring of a graph. St001271The competition number of a graph. St001322The size of a minimal independent dominating set in a graph. St001333The cardinality of a minimal edge-isolating set of a graph. St001337The upper domination number of a graph. St001338The upper irredundance number of a graph. St001339The irredundance number of a graph. St001340The cardinality of a minimal non-edge isolating set of a graph. St001774The degree of the minimal polynomial of the smallest eigenvalue of a graph. St001776The degree of the minimal polynomial of the largest Laplacian eigenvalue of a graph. St001829The common independence number of a graph. St000258The burning number 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. St000918The 2-limited packing number of a 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. 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. St001071The beta invariant of the graph. 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. St001393The induced matching number of a graph. St001572The minimal number of edges to remove to make a graph bipartite. St001638The book thickness of a graph. St001723The differential of a graph. St001724The 2-packing differential of a graph. St001736The total number of cycles in a graph. St001797The number of overfull subgraphs of a graph. St000097The order of the largest clique of the graph. St000268The number of strongly connected orientations of a graph. St001073The number of nowhere zero 3-flows of a graph. St001316The domatic number of a graph. St001330The hat guessing number of a graph. St001716The 1-improper chromatic number of a graph. St001957The number of Hasse diagrams with a given underlying undirected graph. St001642The Prague dimension of a graph. St000455The second largest eigenvalue of a graph if it is integral. St000422The energy of a graph, if it is integral. St000718The largest Laplacian eigenvalue of a graph if it is integral. St000741The Colin de Verdière graph invariant. St001738The minimal order of a graph which is not an induced subgraph of the given graph. 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. St001175The size of a partition minus the hook length of the base cell. St001586The number of odd parts smaller than the largest even part in an integer partition. St001657The number of twos in 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. St000456The monochromatic index of a connected graph. St001118The acyclic chromatic index of a graph. St001281The normalized isoperimetric number of a graph. St001592The maximal number of simple paths between any two different vertices of a graph. St000464The Schultz index of a connected graph. St001545The second Elser number of a connected graph. St001704The size of the largest multi-subset-intersection of the deck of a graph with the deck of another graph. 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. St001256Number of simple reflexive modules that are 2-stable reflexive. St000264The girth of a graph, which is not a tree. St001570The minimal number of edges to add to make a graph Hamiltonian. St001060The distinguishing index of a graph. St000699The toughness times the least common multiple of 1,. St001001The number of indecomposable modules with projective and injective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. St000689The maximal n such that the minimal generator-cogenerator module in the LNakayama algebra of a Dyck path is n-rigid. St001195The global dimension of the algebra $A/AfA$ of the corresponding Nakayama algebra $A$ with minimal left faithful projective-injective module $Af$. 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. St000879The number of long braid edges in the graph of braid moves of a permutation. St001651The Frankl number of a lattice. St001803The maximal overlap of the cylindrical tableau associated with a tableau. St000882The number of connected components of short braid edges in the graph of braid moves of a permutation. St000068The number of minimal elements in a poset. St001846The number of elements which do not have a complement in the lattice. St001719The number of shortest chains of small intervals from the bottom to the top in a lattice. St001820The size of the image of the pop stack sorting operator. St001720The minimal length of a chain of small intervals in a lattice. St000475The number of parts equal to 1 in a partition. St000929The constant term of the character polynomial of an integer partition. St001845The number of join irreducibles minus the rank of a lattice. St001618The cardinality of the Frattini sublattice of a lattice. 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$. 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. 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. St001314The number of tilting modules of arbitrary projective dimension that have no simple modules as a direct summand in the corresponding Nakayama algebra. 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. St000056The decomposition (or block) number of a permutation. St000069The number of maximal elements of a poset. 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. 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. St001590The crossing number of a perfect matching. 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. St001359The number of permutations in the equivalence class of a permutation obtained by taking inverses of cycles. 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$. St001890The maximum magnitude of the Möbius function of a poset. St000175Degree of the polynomial counting the number of semistandard Young tableaux when stretching the shape. St000225Difference between largest and smallest parts in a partition. St000506The number of standard desarrangement tableaux of shape equal to the given partition. 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. St001176The size of a partition minus its first part. St001177Twice the mean value of the major index among all standard Young tableaux of a partition. St001178Twelve times the variance of the major index among all standard Young tableaux of a partition. St001440The number of standard Young tableaux whose major index is congruent one modulo the size of a given integer partition. St001714The number of subpartitions of an integer partition that do not dominate the conjugate subpartition. St001961The sum of the greatest common divisors of all pairs of parts. St000618The number of self-evacuating tableaux of given shape. St001432The order dimension of the partition. 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. St001593This is the number of standard Young tableaux of the given shifted shape. St001601The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on trees. St001609The number of coloured trees such that the multiplicities of colours are given by a partition. St001780The order of promotion on the set of standard tableaux of given shape. St001899The total number of irreducible representations contained in the higher Lie character for an integer partition. St001900The number of distinct irreducible representations contained in the higher Lie character for an integer partition. St001908The number of semistandard tableaux of distinct weight whose maximal entry is the length of the partition. St001913The number of preimages of an integer partition in Bulgarian solitaire. St001924The number of cells in an integer partition whose arm and leg length coincide. St001933The largest multiplicity of a part in an integer partition. St001936The number of transitive factorisations of a permutation of given cycle type into star transpositions. St000944The 3-degree of an integer partition. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St001599The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on rooted trees. St001934The number of monotone factorisations of genus zero of a permutation of given cycle type. St001626The number of maximal proper sublattices of a lattice. St000454The largest eigenvalue of a graph if it is integral. St001597The Frobenius rank of a skew partition. 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. St001568The smallest positive integer that does not appear twice in the partition. St001367The smallest number which does not occur as degree of a vertex in a graph. St001479The number of bridges of a graph. St001363The Euler characteristic of a graph according to Knill. St001496The number of graphs with the same Laplacian spectrum as the given graph. St001625The Möbius invariant of a lattice. St001877Number of indecomposable injective modules with projective dimension 2. St001621The number of atoms of a lattice. St001623The number of doubly irreducible elements of a lattice. St001624The breadth of a lattice. St001875The number of simple modules with projective dimension at most 1. St000550The number of modular elements of a lattice. St000551The number of left modular elements of a lattice. St001754The number of tolerances of a finite lattice. St001103The number of words with multiplicities of the letters given by the partition, avoiding the consecutive pattern 123.