Identifier
Values
([],2) => ([(0,2),(1,2)],3) => ([(1,3),(2,3)],4) => 1
([(0,1)],2) => ([(0,1),(0,2),(1,2)],3) => ([(1,2),(1,3),(2,3)],4) => 2
([(1,2)],3) => ([(0,3),(1,2),(1,3),(2,3)],4) => ([(1,4),(2,3),(2,4),(3,4)],5) => 2
([(0,2),(1,2)],3) => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4) => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 2
([(0,1),(0,2),(1,2)],3) => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4) => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 3
([(2,3)],4) => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5) => ([(1,5),(2,5),(3,4),(3,5),(4,5)],6) => 2
([(1,3),(2,3)],4) => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => ([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 2
([(0,3),(1,2)],4) => ([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5) => ([(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6) => 2
([(0,3),(1,2),(2,3)],4) => ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5) => ([(1,4),(1,5),(2,3),(2,5),(3,4),(3,5),(4,5)],6) => 2
([(1,2),(1,3),(2,3)],4) => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => ([(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 3
([(0,3),(1,2),(1,3),(2,3)],4) => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 3
([(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) => ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 3
([(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,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 4
([],0) => ([],1) => ([],2) => 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 Colin de Verdière graph invariant.
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.
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
vertex addition
Description
Adds a disconnected vertex to a graph.
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!