Values
([],1) => ([],0) => ([],1) => 0
([],2) => ([],0) => ([],1) => 0
([(0,1)],2) => ([],1) => ([(0,1)],2) => 2
([],3) => ([],0) => ([],1) => 0
([(1,2)],3) => ([],1) => ([(0,1)],2) => 2
([(0,2),(1,2)],3) => ([(0,1)],2) => ([(0,1),(0,2),(1,2)],3) => 4
([(0,1),(0,2),(1,2)],3) => ([(0,1),(0,2),(1,2)],3) => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4) => 6
([],4) => ([],0) => ([],1) => 0
([(2,3)],4) => ([],1) => ([(0,1)],2) => 2
([(1,3),(2,3)],4) => ([(0,1)],2) => ([(0,1),(0,2),(1,2)],3) => 4
([(0,3),(1,3),(2,3)],4) => ([(0,1),(0,2),(1,2)],3) => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4) => 6
([(1,2),(1,3),(2,3)],4) => ([(0,1),(0,2),(1,2)],3) => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4) => 6
([],5) => ([],0) => ([],1) => 0
([(3,4)],5) => ([],1) => ([(0,1)],2) => 2
([(2,4),(3,4)],5) => ([(0,1)],2) => ([(0,1),(0,2),(1,2)],3) => 4
([(1,4),(2,4),(3,4)],5) => ([(0,1),(0,2),(1,2)],3) => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4) => 6
([(0,4),(1,4),(2,4),(3,4)],5) => ([(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) => 8
([(2,3),(2,4),(3,4)],5) => ([(0,1),(0,2),(1,2)],3) => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4) => 6
([],6) => ([],0) => ([],1) => 0
([(4,5)],6) => ([],1) => ([(0,1)],2) => 2
([(3,5),(4,5)],6) => ([(0,1)],2) => ([(0,1),(0,2),(1,2)],3) => 4
([(2,5),(3,5),(4,5)],6) => ([(0,1),(0,2),(1,2)],3) => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4) => 6
([(1,5),(2,5),(3,5),(4,5)],6) => ([(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) => 8
([(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) => ([(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) => 10
([(3,4),(3,5),(4,5)],6) => ([(0,1),(0,2),(1,2)],3) => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4) => 6
([],7) => ([],0) => ([],1) => 0
([(5,6)],7) => ([],1) => ([(0,1)],2) => 2
([(4,6),(5,6)],7) => ([(0,1)],2) => ([(0,1),(0,2),(1,2)],3) => 4
([(3,6),(4,6),(5,6)],7) => ([(0,1),(0,2),(1,2)],3) => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4) => 6
([(2,6),(3,6),(4,6),(5,6)],7) => ([(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) => 8
([(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) => ([(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) => 10
([(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) => ([(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) => 12
([(4,5),(4,6),(5,6)],7) => ([(0,1),(0,2),(1,2)],3) => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4) => 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
Description
The energy of a graph, if it is integral.
The energy of a graph is the sum of the absolute values of its eigenvalues. This statistic is only defined for graphs with integral energy. It is known, that the energy is never an odd integer [2]. In fact, it is never the square root of an odd integer [3].
The energy of a graph is the sum of the energies of the connected components of a graph. The energy of the complete graph $K_n$ equals $2n-2$. For this reason, we do not define the energy of the empty graph.
The energy of a graph is the sum of the absolute values of its eigenvalues. This statistic is only defined for graphs with integral energy. It is known, that the energy is never an odd integer [2]. In fact, it is never the square root of an odd integer [3].
The energy of a graph is the sum of the energies of the connected components of a graph. The energy of the complete graph $K_n$ equals $2n-2$. For this reason, we do not define the energy of the empty graph.
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$.
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.
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!