Identifier
Values
[1] => ([],1) => ([],0) => 1
[1,1] => ([(0,1)],2) => ([],1) => 2
[2] => ([],2) => ([],0) => 1
[1,1,1] => ([(0,1),(0,2),(1,2)],3) => ([(0,1),(0,2),(1,2)],3) => 2
[1,2] => ([(1,2)],3) => ([],1) => 2
[2,1] => ([(0,2),(1,2)],3) => ([(0,1)],2) => 2
[3] => ([],3) => ([],0) => 1
[1,1,2] => ([(1,2),(1,3),(2,3)],4) => ([(0,1),(0,2),(1,2)],3) => 2
[1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4) => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4) => 3
[1,3] => ([(2,3)],4) => ([],1) => 2
[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) => 3
[2,2] => ([(1,3),(2,3)],4) => ([(0,1)],2) => 2
[3,1] => ([(0,3),(1,3),(2,3)],4) => ([(0,1),(0,2),(1,2)],3) => 2
[4] => ([],4) => ([],0) => 1
[1,1,3] => ([(2,3),(2,4),(3,4)],5) => ([(0,1),(0,2),(1,2)],3) => 2
[1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5) => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4) => 3
[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) => 3
[1,4] => ([(3,4)],5) => ([],1) => 2
[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) => 3
[2,3] => ([(2,4),(3,4)],5) => ([(0,1)],2) => 2
[3,2] => ([(1,4),(2,4),(3,4)],5) => ([(0,1),(0,2),(1,2)],3) => 2
[4,1] => ([(0,4),(1,4),(2,4),(3,4)],5) => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4) => 2
[5] => ([],5) => ([],0) => 1
[1,1,4] => ([(3,4),(3,5),(4,5)],6) => ([(0,1),(0,2),(1,2)],3) => 2
[1,2,3] => ([(2,5),(3,4),(3,5),(4,5)],6) => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4) => 3
[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) => 3
[1,5] => ([(4,5)],6) => ([],1) => 2
[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) => 3
[2,4] => ([(3,5),(4,5)],6) => ([(0,1)],2) => 2
[3,3] => ([(2,5),(3,5),(4,5)],6) => ([(0,1),(0,2),(1,2)],3) => 2
[4,2] => ([(1,5),(2,5),(3,5),(4,5)],6) => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4) => 2
[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) => 2
[6] => ([],6) => ([],0) => 1
[1,1,5] => ([(4,5),(4,6),(5,6)],7) => ([(0,1),(0,2),(1,2)],3) => 2
[1,2,4] => ([(3,6),(4,5),(4,6),(5,6)],7) => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4) => 3
[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) => 3
[1,6] => ([(5,6)],7) => ([],1) => 2
[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) => 3
[2,5] => ([(4,6),(5,6)],7) => ([(0,1)],2) => 2
[3,4] => ([(3,6),(4,6),(5,6)],7) => ([(0,1),(0,2),(1,2)],3) => 2
[4,3] => ([(2,6),(3,6),(4,6),(5,6)],7) => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4) => 2
[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) => 2
[7] => ([],7) => ([],0) => 1
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 minimal order of a graph which is not an induced subgraph of the given graph.
For example, the graph with two isolated vertices is not an induced subgraph of the complete graph on three vertices.
By contrast, the minimal number of vertices of a graph which is not a subgraph of a graph is one plus the clique number St000097The order of the largest clique of the graph..
For example, the graph with two isolated vertices is not an induced subgraph of the complete graph on three vertices.
By contrast, the minimal number of vertices of a graph which is not a subgraph of a graph is one plus the clique number St000097The order of the largest clique of the graph..
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!