Identifier
Values
['A',1] => ([],1) => ([],1) => ([],1) => 1
['A',2] => ([(0,2),(1,2)],3) => ([(1,2)],3) => ([(1,2)],3) => 2
['B',2] => ([(0,3),(1,3),(3,2)],4) => ([(2,3)],4) => ([(2,3)],4) => 2
['G',2] => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6) => ([(4,5)],6) => ([(4,5)],6) => 2
['A',3] => ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6) => ([(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6) => ([(1,5),(2,4),(3,4),(3,5)],6) => 16
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 composition number of a graph.
This is the number of set partitions of the vertex set of the graph, such that the subgraph induced by each block is connected.
This is the number of set partitions of the vertex set of the graph, such that the subgraph induced by each block is connected.
Map
connected complement
Description
The componentwise connected complement of a graph.
For a connected graph $G$, this map returns the complement of $G$ if it is connected, otherwise $G$ itself. If $G$ is not connected, the map is applied to each connected component separately.
For a connected graph $G$, this map returns the complement of $G$ if it is connected, otherwise $G$ itself. If $G$ is not connected, the map is applied to each connected component separately.
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!