Your data matches 100 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
St001716: Graphs ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([(0,1)],2)
=> 1 = 0 + 1
([(1,2)],3)
=> 1 = 0 + 1
([(0,2),(1,2)],3)
=> 2 = 1 + 1
([(0,1),(0,2),(1,2)],3)
=> 2 = 1 + 1
([(2,3)],4)
=> 1 = 0 + 1
([(1,3),(2,3)],4)
=> 2 = 1 + 1
([(0,3),(1,3),(2,3)],4)
=> 2 = 1 + 1
([(0,3),(1,2)],4)
=> 1 = 0 + 1
([(0,3),(1,2),(2,3)],4)
=> 2 = 1 + 1
([(1,2),(1,3),(2,3)],4)
=> 2 = 1 + 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> 2 = 1 + 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> 2 = 1 + 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 2 = 1 + 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 2 = 1 + 1
([(3,4)],5)
=> 1 = 0 + 1
([(2,4),(3,4)],5)
=> 2 = 1 + 1
([(1,4),(2,4),(3,4)],5)
=> 2 = 1 + 1
([(0,4),(1,4),(2,4),(3,4)],5)
=> 2 = 1 + 1
([(1,4),(2,3)],5)
=> 1 = 0 + 1
([(1,4),(2,3),(3,4)],5)
=> 2 = 1 + 1
([(0,1),(2,4),(3,4)],5)
=> 2 = 1 + 1
([(2,3),(2,4),(3,4)],5)
=> 2 = 1 + 1
([(0,4),(1,4),(2,3),(3,4)],5)
=> 2 = 1 + 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> 2 = 1 + 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 2 = 1 + 1
([(1,3),(1,4),(2,3),(2,4)],5)
=> 2 = 1 + 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> 2 = 1 + 1
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2 = 1 + 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 2 = 1 + 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2 = 1 + 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> 2 = 1 + 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> 2 = 1 + 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> 2 = 1 + 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> 2 = 1 + 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> 2 = 1 + 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 2 = 1 + 1
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> 2 = 1 + 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2 = 1 + 1
([(4,5)],6)
=> 1 = 0 + 1
([(3,5),(4,5)],6)
=> 2 = 1 + 1
([(2,5),(3,5),(4,5)],6)
=> 2 = 1 + 1
([(1,5),(2,5),(3,5),(4,5)],6)
=> 2 = 1 + 1
([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> 2 = 1 + 1
([(2,5),(3,4)],6)
=> 1 = 0 + 1
([(2,5),(3,4),(4,5)],6)
=> 2 = 1 + 1
([(1,2),(3,5),(4,5)],6)
=> 2 = 1 + 1
([(3,4),(3,5),(4,5)],6)
=> 2 = 1 + 1
([(1,5),(2,5),(3,4),(4,5)],6)
=> 2 = 1 + 1
([(0,1),(2,5),(3,5),(4,5)],6)
=> 2 = 1 + 1
([(2,5),(3,4),(3,5),(4,5)],6)
=> 2 = 1 + 1
Description
The 1-improper chromatic number of a graph. This is the least number of colours in a vertex-colouring, such that each vertex has at most one neighbour with the same colour.
Mp00156: Graphs line graphGraphs
Mp00154: Graphs coreGraphs
St000259: Graphs ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([(0,1)],2)
=> ([],1)
=> ([],1)
=> 0
([(1,2)],3)
=> ([],1)
=> ([],1)
=> 0
([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(2,3)],4)
=> ([],1)
=> ([],1)
=> 0
([(1,3),(2,3)],4)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
([(0,3),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,3),(1,2)],4)
=> ([],2)
=> ([],1)
=> 0
([(0,3),(1,2),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 1
([(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,1)],2)
=> 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(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),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(3,4)],5)
=> ([],1)
=> ([],1)
=> 0
([(2,4),(3,4)],5)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
([(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 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
([(1,4),(2,3)],5)
=> ([],2)
=> ([],1)
=> 0
([(1,4),(2,3),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 1
([(0,1),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ([(0,1)],2)
=> 1
([(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 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
([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(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
([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,1)],2)
=> 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
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(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,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 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,4),(1,3),(2,3),(2,4)],5)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,1)],2)
=> 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,2),(1,3),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,2),(1,3),(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(4,5)],6)
=> ([],1)
=> ([],1)
=> 0
([(3,5),(4,5)],6)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
([(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(1,5),(2,5),(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,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
([(2,5),(3,4)],6)
=> ([],2)
=> ([],1)
=> 0
([(2,5),(3,4),(4,5)],6)
=> ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 1
([(1,2),(3,5),(4,5)],6)
=> ([(1,2)],3)
=> ([(0,1)],2)
=> 1
([(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(1,5),(2,5),(3,4),(4,5)],6)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 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
([(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
Description
The diameter of a connected graph. This is the greatest distance between any pair of vertices.
Mp00156: Graphs line graphGraphs
Mp00154: Graphs coreGraphs
St000260: Graphs ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([(0,1)],2)
=> ([],1)
=> ([],1)
=> 0
([(1,2)],3)
=> ([],1)
=> ([],1)
=> 0
([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(2,3)],4)
=> ([],1)
=> ([],1)
=> 0
([(1,3),(2,3)],4)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
([(0,3),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,3),(1,2)],4)
=> ([],2)
=> ([],1)
=> 0
([(0,3),(1,2),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 1
([(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,1)],2)
=> 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(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),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(3,4)],5)
=> ([],1)
=> ([],1)
=> 0
([(2,4),(3,4)],5)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
([(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 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
([(1,4),(2,3)],5)
=> ([],2)
=> ([],1)
=> 0
([(1,4),(2,3),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 1
([(0,1),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ([(0,1)],2)
=> 1
([(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 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
([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(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
([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,1)],2)
=> 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
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(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,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 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,4),(1,3),(2,3),(2,4)],5)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,1)],2)
=> 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,2),(1,3),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,2),(1,3),(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(4,5)],6)
=> ([],1)
=> ([],1)
=> 0
([(3,5),(4,5)],6)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
([(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(1,5),(2,5),(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,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
([(2,5),(3,4)],6)
=> ([],2)
=> ([],1)
=> 0
([(2,5),(3,4),(4,5)],6)
=> ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 1
([(1,2),(3,5),(4,5)],6)
=> ([(1,2)],3)
=> ([(0,1)],2)
=> 1
([(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(1,5),(2,5),(3,4),(4,5)],6)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 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
([(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
Description
The radius of a connected graph. This is the minimum eccentricity of any vertex.
Mp00156: Graphs line graphGraphs
Mp00154: Graphs coreGraphs
St000535: Graphs ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([(0,1)],2)
=> ([],1)
=> ([],1)
=> 0
([(1,2)],3)
=> ([],1)
=> ([],1)
=> 0
([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(2,3)],4)
=> ([],1)
=> ([],1)
=> 0
([(1,3),(2,3)],4)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
([(0,3),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,3),(1,2)],4)
=> ([],2)
=> ([],1)
=> 0
([(0,3),(1,2),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 1
([(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,1)],2)
=> 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(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),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(3,4)],5)
=> ([],1)
=> ([],1)
=> 0
([(2,4),(3,4)],5)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
([(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 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
([(1,4),(2,3)],5)
=> ([],2)
=> ([],1)
=> 0
([(1,4),(2,3),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 1
([(0,1),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ([(0,1)],2)
=> 1
([(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 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
([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(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
([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,1)],2)
=> 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
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(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,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 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,4),(1,3),(2,3),(2,4)],5)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,1)],2)
=> 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,2),(1,3),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,2),(1,3),(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(4,5)],6)
=> ([],1)
=> ([],1)
=> 0
([(3,5),(4,5)],6)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
([(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(1,5),(2,5),(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,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
([(2,5),(3,4)],6)
=> ([],2)
=> ([],1)
=> 0
([(2,5),(3,4),(4,5)],6)
=> ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 1
([(1,2),(3,5),(4,5)],6)
=> ([(1,2)],3)
=> ([(0,1)],2)
=> 1
([(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(1,5),(2,5),(3,4),(4,5)],6)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 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
([(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
Description
The rank-width of a graph.
Mp00156: Graphs line graphGraphs
Mp00154: Graphs coreGraphs
St000985: Graphs ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([(0,1)],2)
=> ([],1)
=> ([],1)
=> 0
([(1,2)],3)
=> ([],1)
=> ([],1)
=> 0
([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(2,3)],4)
=> ([],1)
=> ([],1)
=> 0
([(1,3),(2,3)],4)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
([(0,3),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,3),(1,2)],4)
=> ([],2)
=> ([],1)
=> 0
([(0,3),(1,2),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 1
([(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,1)],2)
=> 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(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),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(3,4)],5)
=> ([],1)
=> ([],1)
=> 0
([(2,4),(3,4)],5)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
([(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 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
([(1,4),(2,3)],5)
=> ([],2)
=> ([],1)
=> 0
([(1,4),(2,3),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 1
([(0,1),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ([(0,1)],2)
=> 1
([(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 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
([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(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
([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,1)],2)
=> 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
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(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,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 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,4),(1,3),(2,3),(2,4)],5)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,1)],2)
=> 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,2),(1,3),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,2),(1,3),(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(4,5)],6)
=> ([],1)
=> ([],1)
=> 0
([(3,5),(4,5)],6)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
([(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(1,5),(2,5),(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,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
([(2,5),(3,4)],6)
=> ([],2)
=> ([],1)
=> 0
([(2,5),(3,4),(4,5)],6)
=> ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 1
([(1,2),(3,5),(4,5)],6)
=> ([(1,2)],3)
=> ([(0,1)],2)
=> 1
([(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(1,5),(2,5),(3,4),(4,5)],6)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 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
([(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
Description
The number of positive eigenvalues of the adjacency matrix of the graph.
Mp00156: Graphs line graphGraphs
Mp00154: Graphs coreGraphs
St001271: Graphs ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([(0,1)],2)
=> ([],1)
=> ([],1)
=> 0
([(1,2)],3)
=> ([],1)
=> ([],1)
=> 0
([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(2,3)],4)
=> ([],1)
=> ([],1)
=> 0
([(1,3),(2,3)],4)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
([(0,3),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,3),(1,2)],4)
=> ([],2)
=> ([],1)
=> 0
([(0,3),(1,2),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 1
([(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,1)],2)
=> 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(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),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(3,4)],5)
=> ([],1)
=> ([],1)
=> 0
([(2,4),(3,4)],5)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
([(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 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
([(1,4),(2,3)],5)
=> ([],2)
=> ([],1)
=> 0
([(1,4),(2,3),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 1
([(0,1),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ([(0,1)],2)
=> 1
([(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 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
([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(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
([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,1)],2)
=> 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
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(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,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 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,4),(1,3),(2,3),(2,4)],5)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,1)],2)
=> 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,2),(1,3),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,2),(1,3),(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(4,5)],6)
=> ([],1)
=> ([],1)
=> 0
([(3,5),(4,5)],6)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
([(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(1,5),(2,5),(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,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
([(2,5),(3,4)],6)
=> ([],2)
=> ([],1)
=> 0
([(2,5),(3,4),(4,5)],6)
=> ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 1
([(1,2),(3,5),(4,5)],6)
=> ([(1,2)],3)
=> ([(0,1)],2)
=> 1
([(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(1,5),(2,5),(3,4),(4,5)],6)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 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
([(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
Description
The competition number of a graph. The competition graph of a digraph $D$ is a (simple undirected) graph which has the same vertex set as $D$ and has an edge between $x$ and $y$ if and only if there exists a vertex $v$ in $D$ such that $(x, v)$ and $(y, v)$ are arcs of $D$. For any graph, $G$ together with sufficiently many isolated vertices is the competition graph of some acyclic digraph. The competition number $k(G)$ is the smallest number of such isolated vertices.
Mp00156: Graphs line graphGraphs
Mp00154: Graphs coreGraphs
St001333: Graphs ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([(0,1)],2)
=> ([],1)
=> ([],1)
=> 0
([(1,2)],3)
=> ([],1)
=> ([],1)
=> 0
([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(2,3)],4)
=> ([],1)
=> ([],1)
=> 0
([(1,3),(2,3)],4)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
([(0,3),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,3),(1,2)],4)
=> ([],2)
=> ([],1)
=> 0
([(0,3),(1,2),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 1
([(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,1)],2)
=> 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(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),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(3,4)],5)
=> ([],1)
=> ([],1)
=> 0
([(2,4),(3,4)],5)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
([(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 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
([(1,4),(2,3)],5)
=> ([],2)
=> ([],1)
=> 0
([(1,4),(2,3),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 1
([(0,1),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ([(0,1)],2)
=> 1
([(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 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
([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(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
([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,1)],2)
=> 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
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(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,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 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,4),(1,3),(2,3),(2,4)],5)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,1)],2)
=> 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,2),(1,3),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,2),(1,3),(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(4,5)],6)
=> ([],1)
=> ([],1)
=> 0
([(3,5),(4,5)],6)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
([(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(1,5),(2,5),(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,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
([(2,5),(3,4)],6)
=> ([],2)
=> ([],1)
=> 0
([(2,5),(3,4),(4,5)],6)
=> ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 1
([(1,2),(3,5),(4,5)],6)
=> ([(1,2)],3)
=> ([(0,1)],2)
=> 1
([(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(1,5),(2,5),(3,4),(4,5)],6)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 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
([(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 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.
Mp00156: Graphs line graphGraphs
Mp00203: Graphs coneGraphs
St001335: Graphs ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([(0,1)],2)
=> ([],1)
=> ([(0,1)],2)
=> 0
([(1,2)],3)
=> ([],1)
=> ([(0,1)],2)
=> 0
([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(2,3)],4)
=> ([],1)
=> ([(0,1)],2)
=> 0
([(1,3),(2,3)],4)
=> ([(0,1)],2)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,3),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(0,3),(1,2)],4)
=> ([],2)
=> ([(0,2),(1,2)],3)
=> 0
([(0,3),(1,2),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,6),(5,6)],7)
=> 1
([(3,4)],5)
=> ([],1)
=> ([(0,1)],2)
=> 0
([(2,4),(3,4)],5)
=> ([(0,1)],2)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 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),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(1,4),(2,3)],5)
=> ([],2)
=> ([(0,2),(1,2)],3)
=> 0
([(1,4),(2,3),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(0,1),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 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,4),(0,5),(1,3),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(0,5),(1,2),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,4),(0,5),(0,6),(1,3),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 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,3),(0,4),(0,5),(0,6),(1,2),(1,4),(1,5),(1,6),(2,3),(2,5),(2,6),(3,4),(3,6),(4,6),(5,6)],7)
=> 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,2),(1,3),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,2),(1,3),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,4),(0,5),(0,6),(1,2),(1,3),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,3),(0,4),(0,6),(1,2),(1,4),(1,5),(1,6),(2,3),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 1
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,2),(1,3),(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,4),(0,5),(0,6),(1,2),(1,3),(1,5),(1,6),(2,3),(2,4),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,6),(5,6)],7)
=> 1
([(4,5)],6)
=> ([],1)
=> ([(0,1)],2)
=> 0
([(3,5),(4,5)],6)
=> ([(0,1)],2)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(1,5),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 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),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
([(2,5),(3,4)],6)
=> ([],2)
=> ([(0,2),(1,2)],3)
=> 0
([(2,5),(3,4),(4,5)],6)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(1,2),(3,5),(4,5)],6)
=> ([(1,2)],3)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(1,5),(2,5),(3,4),(4,5)],6)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,1),(2,5),(3,5),(4,5)],6)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
Description
The cardinality of a minimal cycle-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 all cycles.
Mp00156: Graphs line graphGraphs
Mp00154: Graphs coreGraphs
St001340: Graphs ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([(0,1)],2)
=> ([],1)
=> ([],1)
=> 0
([(1,2)],3)
=> ([],1)
=> ([],1)
=> 0
([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(2,3)],4)
=> ([],1)
=> ([],1)
=> 0
([(1,3),(2,3)],4)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
([(0,3),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,3),(1,2)],4)
=> ([],2)
=> ([],1)
=> 0
([(0,3),(1,2),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 1
([(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,1)],2)
=> 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(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),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(3,4)],5)
=> ([],1)
=> ([],1)
=> 0
([(2,4),(3,4)],5)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
([(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 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
([(1,4),(2,3)],5)
=> ([],2)
=> ([],1)
=> 0
([(1,4),(2,3),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 1
([(0,1),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ([(0,1)],2)
=> 1
([(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 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
([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(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
([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,1)],2)
=> 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
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(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,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 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,4),(1,3),(2,3),(2,4)],5)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,1)],2)
=> 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,2),(1,3),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,2),(1,3),(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(4,5)],6)
=> ([],1)
=> ([],1)
=> 0
([(3,5),(4,5)],6)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
([(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(1,5),(2,5),(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,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
([(2,5),(3,4)],6)
=> ([],2)
=> ([],1)
=> 0
([(2,5),(3,4),(4,5)],6)
=> ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 1
([(1,2),(3,5),(4,5)],6)
=> ([(1,2)],3)
=> ([(0,1)],2)
=> 1
([(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(1,5),(2,5),(3,4),(4,5)],6)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 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
([(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 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.
Mp00156: Graphs line graphGraphs
Mp00154: Graphs coreGraphs
St001349: Graphs ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([(0,1)],2)
=> ([],1)
=> ([],1)
=> 0
([(1,2)],3)
=> ([],1)
=> ([],1)
=> 0
([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(2,3)],4)
=> ([],1)
=> ([],1)
=> 0
([(1,3),(2,3)],4)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
([(0,3),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,3),(1,2)],4)
=> ([],2)
=> ([],1)
=> 0
([(0,3),(1,2),(2,3)],4)
=> ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 1
([(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,1)],2)
=> 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(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),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(3,4)],5)
=> ([],1)
=> ([],1)
=> 0
([(2,4),(3,4)],5)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
([(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 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
([(1,4),(2,3)],5)
=> ([],2)
=> ([],1)
=> 0
([(1,4),(2,3),(3,4)],5)
=> ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 1
([(0,1),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ([(0,1)],2)
=> 1
([(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 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
([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(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
([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,1)],2)
=> 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
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(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,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 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,4),(1,3),(2,3),(2,4)],5)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,1)],2)
=> 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,2),(1,3),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,2),(1,3),(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(4,5)],6)
=> ([],1)
=> ([],1)
=> 0
([(3,5),(4,5)],6)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
([(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(1,5),(2,5),(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,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
([(2,5),(3,4)],6)
=> ([],2)
=> ([],1)
=> 0
([(2,5),(3,4),(4,5)],6)
=> ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 1
([(1,2),(3,5),(4,5)],6)
=> ([(1,2)],3)
=> ([(0,1)],2)
=> 1
([(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([(1,5),(2,5),(3,4),(4,5)],6)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 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
([(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
Description
The number of different graphs obtained from the given graph by removing an edge.
The following 90 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001354The number of series nodes in the modular decomposition of a graph. St001393The induced matching number of a graph. St001512The minimum rank of a graph. St000258The burning number of a graph. St000299The number of nonisomorphic vertex-induced subtrees. 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. St001093The detour number of a graph. St001261The Castelnuovo-Mumford regularity of a graph. St001315The dissociation number of a graph. St001318The number of vertices of the largest induced subforest with the same number of connected components of a graph. St001321The number of vertices of the largest induced subforest of a graph. St001674The number of vertices of the largest induced star graph in the graph. St000481The number of upper covers of a partition in dominance order. St000660The number of rises of length at least 3 of a Dyck path. St000741The Colin de Verdière graph invariant. St001642The Prague dimension of a graph. St001746The coalition number of a graph. St000659The number of rises of length at least 2 of a Dyck path. St000264The girth of a graph, which is not a tree. St001704The size of the largest multi-subset-intersection of the deck of a graph with the deck of another graph. St000455The second largest eigenvalue of a graph if it is integral. 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. St001934The number of monotone factorisations of genus zero of a permutation of given cycle type. 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. St000379The number of Hamiltonian cycles in a graph. St000699The toughness times the least common multiple of 1,. St001281The normalized isoperimetric number of a graph. St001592The maximal number of simple paths between any two different vertices of a graph. St001570The minimal number of edges to add to make a graph Hamiltonian. St000620The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is odd. St000704The number of semistandard tableaux on a given integer partition with minimal maximal entry. St001128The exponens consonantiae of a partition. St001908The number of semistandard tableaux of distinct weight whose maximal entry is the length of the partition. St000175Degree of the polynomial counting the number of semistandard Young tableaux when stretching the shape. St000225Difference between largest and smallest parts in a partition. St000940The number of characters of the symmetric group whose value on the partition is zero. St001124The multiplicity of the standard representation in the Kronecker square corresponding to a partition. St001586The number of odd parts smaller than the largest even part in an integer partition. St001593This is the number of standard Young tableaux of the given shifted shape. St001195The global dimension of the algebra $A/AfA$ of the corresponding Nakayama algebra $A$ with minimal left faithful projective-injective module $Af$. St001060The distinguishing index of a graph. St000456The monochromatic index of a connected graph. St001118The acyclic chromatic index of a graph. St000464The Schultz index of a connected graph. St001545The second Elser number of a connected graph. St001603The number of colourings of a polygon such that the multiplicities of a colour are given by a partition. St000284The Plancherel distribution on integer partitions. St000706The product of the factorials of the multiplicities of an integer partition. St000813The number of zero-one matrices with weakly decreasing column sums and row sums given by the partition. St000901The cube of the number of standard Young tableaux with shape given by the partition. St000928The sum of the coefficients of the character polynomial of an integer partition. St000993The multiplicity of the largest part of an integer partition. St001568The smallest positive integer that does not appear twice in the partition. St001604The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on polygons. St001605The number of colourings of a cycle such that the multiplicities of colours are given by a partition. St000510The number of invariant oriented cycles when acting with a permutation of given cycle type. St000567The sum of the products of all pairs of parts. St000929The constant term of the character polynomial of an integer partition. St000936The number of even values of the symmetric group character corresponding to the partition. St000938The number of zeros of the symmetric group character corresponding to the partition. St001097The coefficient of the monomial symmetric function indexed by the partition in the formal group law for linear orders. St001098The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for vertex labelled trees. St001099The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for leaf labelled binary trees. St001100The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for leaf labelled trees. St001101The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for increasing trees. St001123The multiplicity of the dual of the standard representation in the Kronecker square corresponding to a partition. St001629The coefficient of the integer composition in the quasisymmetric expansion of the relabelling action of the symmetric group on cycles. 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. St000668The least common multiple of the parts of the partition. St000707The product of the factorials of the parts. St000708The product of the parts of an integer partition. St000770The major index of an integer partition when read from bottom to top. St000815The number of semistandard Young tableaux of partition weight of given shape. St000933The number of multipartitions of sizes given by an integer partition. St000478Another weight of a partition according to Alladi. St000566The number of ways to select a row of a Ferrers shape and two cells in this row. St000621The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is even. St000713The dimension of the irreducible representation of Sp(4) labelled by an integer partition. St000714The number of semistandard Young tableau of given shape, with entries at most 2. St000934The 2-degree of an integer partition. St001871The number of triconnected components of a graph. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset.