Identifier
Values
[1,1] => ([(0,1)],2) => ([],1) => 1
[1,1,1] => ([(0,1),(0,2),(1,2)],3) => ([(0,1),(0,2),(1,2)],3) => 1
[1,2] => ([(1,2)],3) => ([],1) => 1
[2,1] => ([(0,2),(1,2)],3) => ([(0,1)],2) => 1
[1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4) => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6) => 2
[1,1,2] => ([(1,2),(1,3),(2,3)],4) => ([(0,1),(0,2),(1,2)],3) => 1
[1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4) => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4) => 2
[1,3] => ([(2,3)],4) => ([],1) => 1
[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,4),(3,4)],5) => 2
[2,2] => ([(1,3),(2,3)],4) => ([(0,1)],2) => 1
[3,1] => ([(0,3),(1,3),(2,3)],4) => ([(0,1),(0,2),(1,2)],3) => 1
[1,1,1,2] => ([(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,4),(2,5),(3,4),(3,5)],6) => 2
[1,1,3] => ([(2,3),(2,4),(3,4)],5) => ([(0,1),(0,2),(1,2)],3) => 1
[1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5) => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4) => 2
[1,3,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5) => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 2
[1,4] => ([(3,4)],5) => ([],1) => 1
[2,1,2] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5) => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5) => 2
[2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => ([(0,1),(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 2
[2,3] => ([(2,4),(3,4)],5) => ([(0,1)],2) => 1
[3,2] => ([(1,4),(2,4),(3,4)],5) => ([(0,1),(0,2),(1,2)],3) => 1
[4,1] => ([(0,4),(1,4),(2,4),(3,4)],5) => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4) => 1
[1,1,1,3] => ([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],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)],6) => 2
[1,1,4] => ([(3,4),(3,5),(4,5)],6) => ([(0,1),(0,2),(1,2)],3) => 1
[1,2,3] => ([(2,5),(3,4),(3,5),(4,5)],6) => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4) => 2
[1,3,2] => ([(1,5),(2,5),(3,4),(3,5),(4,5)],6) => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 2
[1,4,1] => ([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6) => ([(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) => 3
[1,5] => ([(4,5)],6) => ([],1) => 1
[2,1,3] => ([(2,4),(2,5),(3,4),(3,5),(4,5)],6) => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5) => 2
[2,2,2] => ([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => ([(0,1),(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 2
[2,4] => ([(3,5),(4,5)],6) => ([(0,1)],2) => 1
[3,3] => ([(2,5),(3,5),(4,5)],6) => ([(0,1),(0,2),(1,2)],3) => 1
[4,2] => ([(1,5),(2,5),(3,5),(4,5)],6) => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4) => 1
[5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6) => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 1
[1,1,1,4] => ([(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6) => 2
[1,1,5] => ([(4,5),(4,6),(5,6)],7) => ([(0,1),(0,2),(1,2)],3) => 1
[1,2,4] => ([(3,6),(4,5),(4,6),(5,6)],7) => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4) => 2
[1,3,3] => ([(2,6),(3,6),(4,5),(4,6),(5,6)],7) => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 2
[1,4,2] => ([(1,6),(2,6),(3,6),(4,5),(4,6),(5,6)],7) => ([(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) => 3
[1,6] => ([(5,6)],7) => ([],1) => 1
[2,1,4] => ([(3,5),(3,6),(4,5),(4,6),(5,6)],7) => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5) => 2
[2,2,3] => ([(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => ([(0,1),(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 2
[2,5] => ([(4,6),(5,6)],7) => ([(0,1)],2) => 1
[3,4] => ([(3,6),(4,6),(5,6)],7) => ([(0,1),(0,2),(1,2)],3) => 1
[4,3] => ([(2,6),(3,6),(4,6),(5,6)],7) => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4) => 1
[5,2] => ([(1,6),(2,6),(3,6),(4,6),(5,6)],7) => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 1
[6,1] => ([(0,6),(1,6),(2,6),(3,6),(4,6),(5,6)],7) => ([(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
search for individual values
searching the database for the individual values of this statistic
Description
The Prague dimension of a graph.
This is the least number of complete graphs such that the graph is an induced subgraph of their (categorical) product.
Put differently, this is the least number $n$ such that the graph can be embedded into $\mathbb N^n$, where two points are connected by an edge if and only if they differ in all coordinates.
This is the least number of complete graphs such that the graph is an induced subgraph of their (categorical) product.
Put differently, this is the least number $n$ such that the graph can be embedded into $\mathbb N^n$, where two points are connected by an edge if and only if they differ in all coordinates.
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
line graph
Description
The line graph of a graph.
Let $G$ be a graph with edge set $E$. Then its line graph is the graph with vertex set $E$, such that two vertices $e$ and $f$ are adjacent if and only if they are incident to a common vertex in $G$.
Let $G$ be a graph with edge set $E$. Then its line graph is the graph with vertex set $E$, such that two vertices $e$ and $f$ are adjacent if and only if they are incident to a common vertex in $G$.
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!