Identifier
-
Mp00317:
Integer partitions
—odd parts⟶
Binary words
Mp00097: Binary words —delta morphism⟶ Integer compositions
Mp00184: Integer compositions —to threshold graph⟶ Graphs
St001060: Graphs ⟶ ℤ
Values
[2,2,1] => 001 => [2,1] => ([(0,2),(1,2)],3) => 2
[3,2,1] => 101 => [1,1,1] => ([(0,1),(0,2),(1,2)],3) => 3
[2,2,1,1] => 0011 => [2,2] => ([(1,3),(2,3)],4) => 2
[4,2,1] => 001 => [2,1] => ([(0,2),(1,2)],3) => 2
[3,2,1,1] => 1011 => [1,1,2] => ([(1,2),(1,3),(2,3)],4) => 3
[2,2,2,1] => 0001 => [3,1] => ([(0,3),(1,3),(2,3)],4) => 3
[5,2,1] => 101 => [1,1,1] => ([(0,1),(0,2),(1,2)],3) => 3
[4,2,1,1] => 0011 => [2,2] => ([(1,3),(2,3)],4) => 2
[3,3,2] => 110 => [2,1] => ([(0,2),(1,2)],3) => 2
[3,2,2,1] => 1001 => [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4) => 2
[2,2,2,1,1] => 00011 => [3,2] => ([(1,4),(2,4),(3,4)],5) => 3
[6,2,1] => 001 => [2,1] => ([(0,2),(1,2)],3) => 2
[5,2,1,1] => 1011 => [1,1,2] => ([(1,2),(1,3),(2,3)],4) => 3
[4,4,1] => 001 => [2,1] => ([(0,2),(1,2)],3) => 2
[4,3,2] => 010 => [1,1,1] => ([(0,1),(0,2),(1,2)],3) => 3
[4,2,2,1] => 0001 => [3,1] => ([(0,3),(1,3),(2,3)],4) => 3
[3,3,2,1] => 1101 => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4) => 2
[3,2,2,1,1] => 10011 => [1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5) => 2
[2,2,2,2,1] => 00001 => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5) => 4
[7,2,1] => 101 => [1,1,1] => ([(0,1),(0,2),(1,2)],3) => 3
[6,2,1,1] => 0011 => [2,2] => ([(1,3),(2,3)],4) => 2
[5,4,1] => 101 => [1,1,1] => ([(0,1),(0,2),(1,2)],3) => 3
[5,3,2] => 110 => [2,1] => ([(0,2),(1,2)],3) => 2
[5,2,2,1] => 1001 => [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4) => 2
[4,4,1,1] => 0011 => [2,2] => ([(1,3),(2,3)],4) => 2
[4,3,2,1] => 0101 => [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4) => 3
[4,2,2,1,1] => 00011 => [3,2] => ([(1,4),(2,4),(3,4)],5) => 3
[3,3,2,2] => 1100 => [2,2] => ([(1,3),(2,3)],4) => 2
[3,3,2,1,1] => 11011 => [2,1,2] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 2
[3,2,2,2,1] => 10001 => [1,3,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5) => 2
[2,2,2,2,1,1] => 000011 => [4,2] => ([(1,5),(2,5),(3,5),(4,5)],6) => 4
[8,2,1] => 001 => [2,1] => ([(0,2),(1,2)],3) => 2
[7,2,1,1] => 1011 => [1,1,2] => ([(1,2),(1,3),(2,3)],4) => 3
[6,4,1] => 001 => [2,1] => ([(0,2),(1,2)],3) => 2
[6,3,2] => 010 => [1,1,1] => ([(0,1),(0,2),(1,2)],3) => 3
[6,2,2,1] => 0001 => [3,1] => ([(0,3),(1,3),(2,3)],4) => 3
[5,4,1,1] => 1011 => [1,1,2] => ([(1,2),(1,3),(2,3)],4) => 3
[5,3,2,1] => 1101 => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4) => 2
[5,2,2,1,1] => 10011 => [1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5) => 2
[4,4,3] => 001 => [2,1] => ([(0,2),(1,2)],3) => 2
[4,4,2,1] => 0001 => [3,1] => ([(0,3),(1,3),(2,3)],4) => 3
[4,3,2,2] => 0100 => [1,1,2] => ([(1,2),(1,3),(2,3)],4) => 3
[4,3,2,1,1] => 01011 => [1,1,1,2] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 3
[4,2,2,2,1] => 00001 => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5) => 4
[3,3,3,2] => 1110 => [3,1] => ([(0,3),(1,3),(2,3)],4) => 3
[3,3,2,2,1] => 11001 => [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 2
[3,2,2,2,1,1] => 100011 => [1,3,2] => ([(1,5),(2,5),(3,4),(3,5),(4,5)],6) => 2
[2,2,2,2,2,1] => 000001 => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6) => 5
[9,2,1] => 101 => [1,1,1] => ([(0,1),(0,2),(1,2)],3) => 3
[8,2,1,1] => 0011 => [2,2] => ([(1,3),(2,3)],4) => 2
[7,4,1] => 101 => [1,1,1] => ([(0,1),(0,2),(1,2)],3) => 3
[7,3,2] => 110 => [2,1] => ([(0,2),(1,2)],3) => 2
[7,2,2,1] => 1001 => [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4) => 2
[6,4,1,1] => 0011 => [2,2] => ([(1,3),(2,3)],4) => 2
[6,3,2,1] => 0101 => [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4) => 3
[6,2,2,1,1] => 00011 => [3,2] => ([(1,4),(2,4),(3,4)],5) => 3
[5,5,2] => 110 => [2,1] => ([(0,2),(1,2)],3) => 2
[5,4,3] => 101 => [1,1,1] => ([(0,1),(0,2),(1,2)],3) => 3
[5,4,2,1] => 1001 => [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4) => 2
[5,3,2,2] => 1100 => [2,2] => ([(1,3),(2,3)],4) => 2
[5,3,2,1,1] => 11011 => [2,1,2] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 2
[5,2,2,2,1] => 10001 => [1,3,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5) => 2
[4,4,3,1] => 0011 => [2,2] => ([(1,3),(2,3)],4) => 2
[4,4,2,1,1] => 00011 => [3,2] => ([(1,4),(2,4),(3,4)],5) => 3
[4,3,3,2] => 0110 => [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4) => 2
[4,3,2,2,1] => 01001 => [1,1,2,1] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 2
[4,2,2,2,1,1] => 000011 => [4,2] => ([(1,5),(2,5),(3,5),(4,5)],6) => 4
[3,3,3,2,1] => 11101 => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 2
[3,3,2,2,1,1] => 110011 => [2,2,2] => ([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 2
[3,2,2,2,2,1] => 100001 => [1,4,1] => ([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6) => 3
[10,2,1] => 001 => [2,1] => ([(0,2),(1,2)],3) => 2
[9,2,1,1] => 1011 => [1,1,2] => ([(1,2),(1,3),(2,3)],4) => 3
[8,4,1] => 001 => [2,1] => ([(0,2),(1,2)],3) => 2
[8,3,2] => 010 => [1,1,1] => ([(0,1),(0,2),(1,2)],3) => 3
[8,2,2,1] => 0001 => [3,1] => ([(0,3),(1,3),(2,3)],4) => 3
[7,4,1,1] => 1011 => [1,1,2] => ([(1,2),(1,3),(2,3)],4) => 3
[7,3,2,1] => 1101 => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4) => 2
[7,2,2,1,1] => 10011 => [1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5) => 2
[6,6,1] => 001 => [2,1] => ([(0,2),(1,2)],3) => 2
[6,5,2] => 010 => [1,1,1] => ([(0,1),(0,2),(1,2)],3) => 3
[6,4,3] => 001 => [2,1] => ([(0,2),(1,2)],3) => 2
[6,4,2,1] => 0001 => [3,1] => ([(0,3),(1,3),(2,3)],4) => 3
[6,3,2,2] => 0100 => [1,1,2] => ([(1,2),(1,3),(2,3)],4) => 3
[6,3,2,1,1] => 01011 => [1,1,1,2] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 3
[6,2,2,2,1] => 00001 => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5) => 4
[5,5,2,1] => 1101 => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4) => 2
[5,4,3,1] => 1011 => [1,1,2] => ([(1,2),(1,3),(2,3)],4) => 3
[5,4,2,1,1] => 10011 => [1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5) => 2
[5,3,3,2] => 1110 => [3,1] => ([(0,3),(1,3),(2,3)],4) => 3
[5,3,2,2,1] => 11001 => [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 2
[5,2,2,2,1,1] => 100011 => [1,3,2] => ([(1,5),(2,5),(3,4),(3,5),(4,5)],6) => 2
[4,4,4,1] => 0001 => [3,1] => ([(0,3),(1,3),(2,3)],4) => 3
[4,4,3,2] => 0010 => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4) => 2
[4,4,2,2,1] => 00001 => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5) => 4
[4,3,3,2,1] => 01101 => [1,2,1,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 2
[4,3,2,2,1,1] => 010011 => [1,1,2,2] => ([(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 2
[4,2,2,2,2,1] => 000001 => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6) => 5
[3,3,3,2,2] => 11100 => [3,2] => ([(1,4),(2,4),(3,4)],5) => 3
[3,3,3,2,1,1] => 111011 => [3,1,2] => ([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 2
[3,3,2,2,2,1] => 110001 => [2,3,1] => ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 2
[11,2,1] => 101 => [1,1,1] => ([(0,1),(0,2),(1,2)],3) => 3
>>> Load all 334 entries. <<<
search for individual values
searching the database for the individual values of this statistic
Description
The distinguishing index of a graph.
This is the smallest number of colours such that there is a colouring of the edges which is not preserved by any automorphism.
If the graph has a connected component which is a single edge, or at least two isolated vertices, this statistic is undefined.
This is the smallest number of colours such that there is a colouring of the edges which is not preserved by any automorphism.
If the graph has a connected component which is a single edge, or at least two isolated vertices, this statistic is undefined.
Map
delta morphism
Description
Applies the delta morphism to a binary word.
The delta morphism of a finite word $w$ is the integer compositions composed of the lengths of consecutive runs of the same letter in $w$.
The delta morphism of a finite word $w$ is the integer compositions composed of the lengths of consecutive runs of the same letter in $w$.
Map
odd parts
Description
Return the binary word indicating which parts of the partition are odd.
Map
to threshold graph
Description
The threshold graph corresponding to the composition.
A threshold graph is a graph that can be obtained from the empty graph by adding successively isolated and dominating vertices.
A threshold graph is uniquely determined by its degree sequence.
The Laplacian spectrum of a threshold graph is integral. Interpreting it as an integer partition, it is the conjugate of the partition given by its degree sequence.
A threshold graph is a graph that can be obtained from the empty graph by adding successively isolated and dominating vertices.
A threshold graph is uniquely determined by its degree sequence.
The Laplacian spectrum of a threshold graph is integral. Interpreting it as an integer partition, it is the conjugate of the partition given by its degree sequence.
searching the database
Sorry, this statistic was not found in the database
or
add this statistic to the database – it's very simple and we need your support!