Identifier
Values
0 => ([(0,1)],2) => ([],2) => ([(0,1)],2) => 1
1 => ([(0,1)],2) => ([],2) => ([(0,1)],2) => 1
00 => ([(0,2),(2,1)],3) => ([],3) => ([(0,1),(0,2),(1,2)],3) => 2
01 => ([(0,1),(0,2),(1,3),(2,3)],4) => ([(2,3)],4) => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4) => 1
10 => ([(0,1),(0,2),(1,3),(2,3)],4) => ([(2,3)],4) => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4) => 1
11 => ([(0,2),(2,1)],3) => ([],3) => ([(0,1),(0,2),(1,2)],3) => 2
000 => ([(0,3),(2,1),(3,2)],4) => ([],4) => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4) => 3
001 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => ([(2,5),(3,4),(4,5)],6) => ([(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
010 => ([(0,1),(0,2),(1,4),(1,5),(2,4),(2,5),(4,3),(5,3)],6) => ([(2,5),(3,4)],6) => ([(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) => 2
011 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => ([(2,5),(3,4),(4,5)],6) => ([(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
100 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => ([(2,5),(3,4),(4,5)],6) => ([(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
101 => ([(0,1),(0,2),(1,4),(1,5),(2,4),(2,5),(4,3),(5,3)],6) => ([(2,5),(3,4)],6) => ([(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) => 2
110 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => ([(2,5),(3,4),(4,5)],6) => ([(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
111 => ([(0,3),(2,1),(3,2)],4) => ([],4) => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4) => 3
0000 => ([(0,4),(2,3),(3,1),(4,2)],5) => ([],5) => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 4
1111 => ([(0,4),(2,3),(3,1),(4,2)],5) => ([],5) => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 4
00000 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => ([],6) => ([(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) => 5
11111 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => ([],6) => ([(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) => 5
000000 => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7) => ([],7) => ([(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) => 6
111111 => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7) => ([],7) => ([(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) => 6
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 multiplicity of the largest distance Laplacian eigenvalue in a connected graph.
The distance Laplacian of a graph is the (symmetric) matrix with row and column sums $0$, which has the negative distances between two vertices as its off-diagonal entries. This statistic is the largest multiplicity of an eigenvalue.
For example, the cycle on four vertices has distance Laplacian
$$ \left(\begin{array}{rrrr} 4 & -1 & -2 & -1 \\ -1 & 4 & -1 & -2 \\ -2 & -1 & 4 & -1 \\ -1 & -2 & -1 & 4 \end{array}\right). $$
Its eigenvalues are $0,4,4,6$, so the statistic is $1$.
The path on four vertices has eigenvalues $0, 4.7\dots, 6, 9.2\dots$ and therefore also statistic $1$.
The graphs with statistic $n-1$, $n-2$ and $n-3$ have been characterised, see [1].
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
complement
Description
The complement of a graph.
The complement of a graph has the same vertices, but exactly those edges that are not in the original graph.
Map
incomparability graph
Description
The incomparability graph of a poset.