Identifier
Values
0 => ([(0,1)],2) => ([(0,1)],2) => 0
1 => ([(0,1)],2) => ([(0,1)],2) => 0
00 => ([(0,2),(2,1)],3) => ([(0,2),(1,2)],3) => 1
01 => ([(0,1),(0,2),(1,3),(2,3)],4) => ([(0,2),(0,3),(1,2),(1,3)],4) => 0
10 => ([(0,1),(0,2),(1,3),(2,3)],4) => ([(0,2),(0,3),(1,2),(1,3)],4) => 0
11 => ([(0,2),(2,1)],3) => ([(0,2),(1,2)],3) => 1
000 => ([(0,3),(2,1),(3,2)],4) => ([(0,3),(1,2),(2,3)],4) => 2
001 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => ([(0,3),(0,5),(1,2),(1,5),(2,4),(3,4),(4,5)],6) => 0
010 => ([(0,1),(0,2),(1,4),(1,5),(2,4),(2,5),(4,3),(5,3)],6) => ([(0,4),(0,5),(1,2),(1,3),(2,4),(2,5),(3,4),(3,5)],6) => 0
011 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => ([(0,3),(0,5),(1,2),(1,5),(2,4),(3,4),(4,5)],6) => 0
100 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => ([(0,3),(0,5),(1,2),(1,5),(2,4),(3,4),(4,5)],6) => 0
101 => ([(0,1),(0,2),(1,4),(1,5),(2,4),(2,5),(4,3),(5,3)],6) => ([(0,4),(0,5),(1,2),(1,3),(2,4),(2,5),(3,4),(3,5)],6) => 0
110 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => ([(0,3),(0,5),(1,2),(1,5),(2,4),(3,4),(4,5)],6) => 0
111 => ([(0,3),(2,1),(3,2)],4) => ([(0,3),(1,2),(2,3)],4) => 2
0000 => ([(0,4),(2,3),(3,1),(4,2)],5) => ([(0,4),(1,3),(2,3),(2,4)],5) => 3
1111 => ([(0,4),(2,3),(3,1),(4,2)],5) => ([(0,4),(1,3),(2,3),(2,4)],5) => 3
00000 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => ([(0,5),(1,4),(2,3),(2,4),(3,5)],6) => 4
11111 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => ([(0,5),(1,4),(2,3),(2,4),(3,5)],6) => 4
000000 => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7) => ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7) => 5
111111 => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7) => ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7) => 5
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
click to show known generating functions       
Description
The number of cut vertices of a graph.
A cut vertex is one whose deletion increases the number of connected components.
Map
poset of factors
Description
The poset of factors of a binary word.
This is the partial order on the set of distinct factors of a binary word, such that $u < v$ if and only if $u$ is a factor of $v$.
Map
to graph
Description
Returns the Hasse diagram of the poset as an undirected graph.