Your data matches 1 statistic following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St001951
(load all 7 compositions to match this statistic)
Mapping
St001951: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
 => 1
([],2)
 => 1
([(0,1)],2)
 => 1
([],3)
 => 1
([(1,2)],3)
 => 2
([(0,2),(1,2)],3)
 => 2
([(0,1),(0,2),(1,2)],3)
 => 1
([],4)
 => 1
([(2,3)],4)
 => 2
([(1,3),(2,3)],4)
 => 3
([(0,3),(1,3),(2,3)],4)
 => 2
([(0,3),(1,2)],4)
 => 1
([(0,3),(1,2),(2,3)],4)
 => 1
([(1,2),(1,3),(2,3)],4)
 => 2
([(0,3),(1,2),(1,3),(2,3)],4)
 => 3
([(0,2),(0,3),(1,2),(1,3)],4)
 => 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 2
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 1
([],5)
 => 1
([(3,4)],5)
 => 2
([(2,4),(3,4)],5)
 => 3
([(1,4),(2,4),(3,4)],5)
 => 3
([(0,4),(1,4),(2,4),(3,4)],5)
 => 2
([(1,4),(2,3)],5)
 => 2
([(1,4),(2,3),(3,4)],5)
 => 2
([(0,1),(2,4),(3,4)],5)
 => 3
([(2,3),(2,4),(3,4)],5)
 => 2
([(0,4),(1,4),(2,3),(3,4)],5)
 => 4
([(1,4),(2,3),(2,4),(3,4)],5)
 => 4
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
 => 3
([(1,3),(1,4),(2,3),(2,4)],5)
 => 2
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
 => 4
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 3
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => 2
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 4
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
 => 2
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 2
([(0,4),(1,3),(2,3),(2,4)],5)
 => 2
([(0,1),(2,3),(2,4),(3,4)],5)
 => 2
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
 => 4
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
 => 2
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
 => 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
 => 2
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
 => 2
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
 => 4
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 2
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 3
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 3
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
 => 3
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
 => 2
Description
The number of factors in the disjoint direct product decomposition of the automorphism group of a graph. The disjoint direct product decomposition of a permutation group factors the group corresponding to the product $(G, X) \ast (H, Y) = (G\times H, Z)$, where $Z$ is the disjoint union of $X$ and $Y$. In particular, for an asymmetric graph, i.e., with trivial automorphism group, this statistic equals the number of vertices, because the trivial action factors completely.