Identifier
Values
0 => [1] => ([],1) => ([(0,1)],2) => -1
1 => [1] => ([],1) => ([(0,1)],2) => -1
00 => [2] => ([],2) => ([(0,2),(1,2)],3) => 0
01 => [1,1] => ([(0,1)],2) => ([(0,1),(0,2),(1,2)],3) => -1
10 => [1,1] => ([(0,1)],2) => ([(0,1),(0,2),(1,2)],3) => -1
11 => [2] => ([],2) => ([(0,2),(1,2)],3) => 0
000 => [3] => ([],3) => ([(0,3),(1,3),(2,3)],4) => 0
001 => [2,1] => ([(0,2),(1,2)],3) => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4) => 0
010 => [1,1,1] => ([(0,1),(0,2),(1,2)],3) => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4) => -1
101 => [1,1,1] => ([(0,1),(0,2),(1,2)],3) => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4) => -1
110 => [2,1] => ([(0,2),(1,2)],3) => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4) => 0
111 => [3] => ([],3) => ([(0,3),(1,3),(2,3)],4) => 0
0000 => [4] => ([],4) => ([(0,4),(1,4),(2,4),(3,4)],5) => 0
0001 => [3,1] => ([(0,3),(1,3),(2,3)],4) => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 0
0010 => [2,1,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,3),(2,4),(3,4)],5) => 0
0101 => [1,1,1,1] => ([(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
1010 => [1,1,1,1] => ([(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
1101 => [2,1,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,3),(2,4),(3,4)],5) => 0
1110 => [3,1] => ([(0,3),(1,3),(2,3)],4) => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 0
1111 => [4] => ([],4) => ([(0,4),(1,4),(2,4),(3,4)],5) => 0
00000 => [5] => ([],5) => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6) => 0
00001 => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5) => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 0
00010 => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => ([(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) => 0
00101 => [2,1,1,1] => ([(0,2),(0,3),(0,4),(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,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 0
01010 => [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) => ([(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
10101 => [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) => ([(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
11010 => [2,1,1,1] => ([(0,2),(0,3),(0,4),(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,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 0
11101 => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => ([(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) => 0
11110 => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5) => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 0
11111 => [5] => ([],5) => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6) => 0
000000 => [6] => ([],6) => ([(0,6),(1,6),(2,6),(3,6),(4,6),(5,6)],7) => 0
000001 => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6) => ([(0,5),(0,6),(1,5),(1,6),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 0
000010 => [4,1,1] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => ([(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) => 0
000101 => [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) => ([(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) => 0
001010 => [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) => ([(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) => 0
010101 => [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) => ([(0,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
101010 => [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) => ([(0,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
110101 => [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) => ([(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) => 0
111010 => [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) => ([(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) => 0
111101 => [4,1,1] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => ([(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) => 0
111110 => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6) => ([(0,5),(0,6),(1,5),(1,6),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 0
111111 => [6] => ([],6) => ([(0,6),(1,6),(2,6),(3,6),(4,6),(5,6)],7) => 0
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 second largest eigenvalue of a graph if it is integral.
This statistic is undefined if the second largest eigenvalue of the graph is not integral.
Chapter 4 of [1] provides lots of context.
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.
Map
cone
Description
The cone of a graph.
The cone of a graph is obtained by joining a new vertex to all the vertices of the graph. The added vertex is called a universal vertex or a dominating vertex.
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$.