Processing math: 100%

Identifier
Values
([],1) => ([],1) => ([],1) => ([(0,1)],2) => 0
([(0,1)],2) => ([(0,1)],2) => ([(0,1)],2) => ([(0,1),(0,2),(1,2)],3) => 0
([(0,2),(2,1)],3) => ([(0,2),(2,1)],3) => ([(0,2),(1,2)],3) => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4) => 0
([(0,1),(0,2),(1,3),(2,3)],4) => ([(0,1),(0,2),(1,3),(2,3)],4) => ([(0,2),(0,3),(1,2),(1,3)],4) => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5) => 1
([(0,3),(2,1),(3,2)],4) => ([(0,3),(2,1),(3,2)],4) => ([(0,3),(1,2),(2,3)],4) => ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5) => 0
([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5) => ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5) => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5) => ([(0,3),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6) => 1
([(0,2),(0,3),(1,4),(2,4),(3,1)],5) => ([(0,2),(0,3),(1,4),(2,4),(3,1)],5) => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5) => ([(0,3),(0,4),(0,5),(1,2),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6) => 1
([(0,3),(1,4),(2,4),(3,1),(3,2)],5) => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5) => ([(0,4),(1,2),(1,3),(2,4),(3,4)],5) => ([(0,4),(0,5),(1,2),(1,3),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 1
([(0,4),(2,3),(3,1),(4,2)],5) => ([(0,4),(2,3),(3,1),(4,2)],5) => ([(0,4),(1,3),(2,3),(2,4)],5) => ([(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6) => 0
([(0,2),(0,3),(2,4),(3,4),(4,1)],5) => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5) => ([(0,4),(1,2),(1,3),(2,4),(3,4)],5) => ([(0,4),(0,5),(1,2),(1,3),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 1
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 number of triconnected components of a graph.
A connected graph is triconnected or 3-vertex connected if it cannot be disconnected by removing two or fewer vertices. An arbitrary connected graph can be decomposed as a union of biconnected (2-vertex connected) graphs, known as blocks, and each biconnected graph can be decomposed as a union of components with are either a cycle (type "S"), a cocyle (type "P"), or triconnected (type "R"). The decomposition of a biconnected graph into these components is known as the SPQR-tree 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
to graph
Description
Returns the Hasse diagram of the poset as an undirected graph.
Map
to poset
Description
Return the poset corresponding to the lattice.