Identifier
Values
['A',1] => ([],1) => ([],1) => ([(0,1)],2) => 2
['A',2] => ([(0,2),(1,2)],3) => ([(1,2)],3) => ([(0,3),(1,2),(1,3),(2,3)],4) => 4
['B',2] => ([(0,3),(1,3),(3,2)],4) => ([(2,3)],4) => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5) => 5
['G',2] => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6) => ([(4,5)],6) => ([(0,6),(1,6),(2,6),(3,6),(4,5),(4,6),(5,6)],7) => 7
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 harmonious chromatic number of a graph.
A harmonious colouring is a proper vertex colouring such that any pair of colours appears at most once on adjacent vertices.
A harmonious colouring is a proper vertex colouring such that any pair of colours appears at most once on adjacent 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 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 $\alpha \prec \beta$ if $\beta - \alpha$ is a simple root.
This is the poset on the set of positive roots of its root system where $\alpha \prec \beta$ if $\beta - \alpha$ is a simple root.
Map
incomparability graph
Description
The incomparability graph of a poset.
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!