Identifier
-
Mp00178:
Binary words
—to composition⟶
Integer compositions
Mp00184: Integer compositions —to threshold graph⟶ Graphs
St001271: Graphs ⟶ ℤ
Values
0 => [2] => ([],2) => 0
1 => [1,1] => ([(0,1)],2) => 1
00 => [3] => ([],3) => 0
01 => [2,1] => ([(0,2),(1,2)],3) => 1
10 => [1,2] => ([(1,2)],3) => 0
11 => [1,1,1] => ([(0,1),(0,2),(1,2)],3) => 1
000 => [4] => ([],4) => 0
001 => [3,1] => ([(0,3),(1,3),(2,3)],4) => 1
010 => [2,2] => ([(1,3),(2,3)],4) => 0
011 => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4) => 1
100 => [1,3] => ([(2,3)],4) => 0
101 => [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4) => 1
110 => [1,1,2] => ([(1,2),(1,3),(2,3)],4) => 0
111 => [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4) => 1
0000 => [5] => ([],5) => 0
0001 => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5) => 1
0010 => [3,2] => ([(1,4),(2,4),(3,4)],5) => 0
0011 => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 1
0100 => [2,3] => ([(2,4),(3,4)],5) => 0
0101 => [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 1
0110 => [2,1,2] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 0
0111 => [2,1,1,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 1
1000 => [1,4] => ([(3,4)],5) => 0
1001 => [1,3,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5) => 1
1010 => [1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5) => 0
1011 => [1,2,1,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 1
1100 => [1,1,3] => ([(2,3),(2,4),(3,4)],5) => 0
1101 => [1,1,2,1] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 1
1110 => [1,1,1,2] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 0
1111 => [1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 1
00000 => [6] => ([],6) => 0
00001 => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6) => 1
00010 => [4,2] => ([(1,5),(2,5),(3,5),(4,5)],6) => 0
00011 => [4,1,1] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 1
00100 => [3,3] => ([(2,5),(3,5),(4,5)],6) => 0
00101 => [3,2,1] => ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 1
00110 => [3,1,2] => ([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 0
00111 => [3,1,1,1] => ([(0,3),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 1
01000 => [2,4] => ([(3,5),(4,5)],6) => 0
01001 => [2,3,1] => ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 1
01010 => [2,2,2] => ([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 0
01011 => [2,2,1,1] => ([(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 1
01100 => [2,1,3] => ([(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 0
01101 => [2,1,2,1] => ([(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 1
01110 => [2,1,1,2] => ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 0
01111 => [2,1,1,1,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
10000 => [1,5] => ([(4,5)],6) => 0
10001 => [1,4,1] => ([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6) => 1
10010 => [1,3,2] => ([(1,5),(2,5),(3,4),(3,5),(4,5)],6) => 0
10011 => [1,3,1,1] => ([(0,4),(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 1
10100 => [1,2,3] => ([(2,5),(3,4),(3,5),(4,5)],6) => 0
10101 => [1,2,2,1] => ([(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 1
10110 => [1,2,1,2] => ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 0
10111 => [1,2,1,1,1] => ([(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
11000 => [1,1,4] => ([(3,4),(3,5),(4,5)],6) => 0
11001 => [1,1,3,1] => ([(0,5),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 1
11010 => [1,1,2,2] => ([(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 0
11011 => [1,1,2,1,1] => ([(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
11100 => [1,1,1,3] => ([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 0
11101 => [1,1,1,2,1] => ([(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 1
11110 => [1,1,1,1,2] => ([(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 0
11111 => [1,1,1,1,1,1] => ([(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
000000 => [7] => ([],7) => 0
000001 => [6,1] => ([(0,6),(1,6),(2,6),(3,6),(4,6),(5,6)],7) => 1
000010 => [5,2] => ([(1,6),(2,6),(3,6),(4,6),(5,6)],7) => 0
000011 => [5,1,1] => ([(0,5),(0,6),(1,5),(1,6),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 1
000100 => [4,3] => ([(2,6),(3,6),(4,6),(5,6)],7) => 0
000101 => [4,2,1] => ([(0,6),(1,5),(1,6),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 1
000110 => [4,1,2] => ([(1,5),(1,6),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 0
000111 => [4,1,1,1] => ([(0,4),(0,5),(0,6),(1,4),(1,5),(1,6),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 1
001000 => [3,4] => ([(3,6),(4,6),(5,6)],7) => 0
001001 => [3,3,1] => ([(0,6),(1,6),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 1
001010 => [3,2,2] => ([(1,6),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 0
001011 => [3,2,1,1] => ([(0,5),(0,6),(1,4),(1,5),(1,6),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 1
001100 => [3,1,3] => ([(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 0
001101 => [3,1,2,1] => ([(0,6),(1,4),(1,5),(1,6),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 1
001110 => [3,1,1,2] => ([(1,4),(1,5),(1,6),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 0
001111 => [3,1,1,1,1] => ([(0,3),(0,4),(0,5),(0,6),(1,3),(1,4),(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
010000 => [2,5] => ([(4,6),(5,6)],7) => 0
010001 => [2,4,1] => ([(0,6),(1,6),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 1
010010 => [2,3,2] => ([(1,6),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 0
010011 => [2,3,1,1] => ([(0,5),(0,6),(1,5),(1,6),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 1
010100 => [2,2,3] => ([(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 0
010101 => [2,2,2,1] => ([(0,6),(1,5),(1,6),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 1
010110 => [2,2,1,2] => ([(1,5),(1,6),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 0
010111 => [2,2,1,1,1] => ([(0,4),(0,5),(0,6),(1,3),(1,4),(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
011000 => [2,1,4] => ([(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 0
011001 => [2,1,3,1] => ([(0,6),(1,6),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 1
011010 => [2,1,2,2] => ([(1,6),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 0
011011 => [2,1,2,1,1] => ([(0,5),(0,6),(1,3),(1,4),(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
011100 => [2,1,1,3] => ([(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 0
011101 => [2,1,1,2,1] => ([(0,6),(1,3),(1,4),(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
011110 => [2,1,1,1,2] => ([(1,3),(1,4),(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) => 0
011111 => [2,1,1,1,1,1] => ([(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(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
100000 => [1,6] => ([(5,6)],7) => 0
100001 => [1,5,1] => ([(0,6),(1,6),(2,6),(3,6),(4,5),(4,6),(5,6)],7) => 1
100010 => [1,4,2] => ([(1,6),(2,6),(3,6),(4,5),(4,6),(5,6)],7) => 0
100011 => [1,4,1,1] => ([(0,5),(0,6),(1,5),(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 1
100100 => [1,3,3] => ([(2,6),(3,6),(4,5),(4,6),(5,6)],7) => 0
100101 => [1,3,2,1] => ([(0,6),(1,5),(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 1
100110 => [1,3,1,2] => ([(1,5),(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 0
>>> Load all 127 entries. <<<
search for individual values
searching the database for the individual values of this statistic
/
search for generating function
searching the database for statistics with the same generating function
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.
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.
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.
Map
to composition
Description
The composition corresponding to a binary word.
Prepending 1 to a binary word w, the i-th part of the composition equals 1 plus the number of zeros after the i-th 1 in w.
This map is not surjective, since the empty composition does not have a preimage.
Prepending 1 to a binary word w, the i-th part of the composition equals 1 plus the number of zeros after the i-th 1 in w.
This map is not surjective, since the empty composition does not have a preimage.
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!