Identifier
Values
['A',1] => ([],1) => ([],1) => ([(0,1)],2) => 0
['A',2] => ([(0,2),(1,2)],3) => ([(0,2),(1,2)],3) => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4) => 2
['B',2] => ([(0,3),(1,3),(3,2)],4) => ([(0,3),(1,3),(2,3)],4) => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 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
Description
The number of triangles of a graph.
A triangle T of a graph G is a collection of three vertices {u,v,w}∈G such that they form K3, the complete graph on three vertices.
A triangle T of a graph G is a collection of three vertices {u,v,w}∈G such that they form K3, the complete graph on three vertices.
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
to graph
Description
Returns the Hasse diagram of the poset as an undirected graph.
Map
to root poset
Description
The root poset of a finite Cartan type.
This is the poset on the set of positive roots of its root system where α≺β if β−α is a simple root.
This is the poset on the set of positive roots of its root system where α≺β if β−α is a simple root.
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!