Identifier
Values
([],1) => ([(0,1)],2) => ([],1) => 0
([],2) => ([(0,2),(1,2)],3) => ([(0,1)],2) => 1
([(0,1)],2) => ([(0,1),(0,2),(1,2)],3) => ([(0,1),(0,2),(1,2)],3) => 2
([],3) => ([(0,3),(1,3),(2,3)],4) => ([(0,1),(0,2),(1,2)],3) => 2
([(1,2)],3) => ([(0,3),(1,2),(1,3),(2,3)],4) => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4) => 2
([(0,2),(1,2)],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,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) => ([(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) => 3
([],4) => ([(0,4),(1,4),(2,4),(3,4)],5) => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4) => 2
([(2,3)],4) => ([(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,3),(2,3)],4) => ([(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) => 3
([(0,3),(1,3),(2,3)],4) => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,4),(1,5),(1,6),(2,3),(2,5),(2,6),(3,4),(3,6),(4,6),(5,6)],7) => 3
([(0,3),(1,2)],4) => ([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5) => ([(0,4),(0,5),(1,2),(1,3),(2,3),(2,4),(2,5),(3,4),(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) => ([(0,3),(0,4),(0,6),(1,2),(1,4),(1,5),(2,3),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 3
([(1,2),(1,3),(2,3)],4) => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => ([(0,4),(0,5),(0,6),(1,2),(1,3),(1,5),(1,6),(2,3),(2,4),(2,6),(3,4),(3,5),(4,5),(4,6),(5,6)],7) => 3
([],5) => ([(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) => 3
([(3,4)],5) => ([(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
([(2,4),(3,4)],5) => ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => ([(0,1),(0,5),(0,6),(1,4),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 3
([(1,4),(2,3)],5) => ([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6) => ([(0,5),(0,6),(1,3),(1,4),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 3
([],6) => ([(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) => 3
([(4,5)],6) => ([(0,6),(1,6),(2,6),(3,6),(4,5),(4,6),(5,6)],7) => ([(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) => 3
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 arboricity of a graph.
This is the minimum number of forests that covers all edges of the graph.
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
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$.