Your data matches 1 statistic following compositions of up to 3 maps.
(click to perform a complete search on your data)
St001441: Graphs ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([],1)
=> 1
([],2)
=> 2
([(0,1)],2)
=> 3
([],3)
=> 3
([(1,2)],3)
=> 4
([(0,2),(1,2)],3)
=> 6
([(0,1),(0,2),(1,2)],3)
=> 7
([],4)
=> 4
([(2,3)],4)
=> 5
([(1,3),(2,3)],4)
=> 7
([(0,3),(1,3),(2,3)],4)
=> 11
([(0,3),(1,2)],4)
=> 6
([(0,3),(1,2),(2,3)],4)
=> 10
([(1,2),(1,3),(2,3)],4)
=> 8
([(0,3),(1,2),(1,3),(2,3)],4)
=> 12
([(0,2),(0,3),(1,2),(1,3)],4)
=> 13
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 14
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 15
([],5)
=> 5
([(3,4)],5)
=> 6
([(2,4),(3,4)],5)
=> 8
([(1,4),(2,4),(3,4)],5)
=> 12
([(0,4),(1,4),(2,4),(3,4)],5)
=> 20
([(1,4),(2,3)],5)
=> 7
([(1,4),(2,3),(3,4)],5)
=> 11
([(0,1),(2,4),(3,4)],5)
=> 9
([(2,3),(2,4),(3,4)],5)
=> 9
([(0,4),(1,4),(2,3),(3,4)],5)
=> 17
([(1,4),(2,3),(2,4),(3,4)],5)
=> 13
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 21
([(1,3),(1,4),(2,3),(2,4)],5)
=> 14
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> 21
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 15
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 19
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 23
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> 26
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 27
([(0,4),(1,3),(2,3),(2,4)],5)
=> 15
([(0,1),(2,3),(2,4),(3,4)],5)
=> 10
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> 18
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> 22
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 21
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 24
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> 26
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> 22
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 16
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 24
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 28
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> 27
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 29
Description
The number of non-empty connected induced subgraphs of a graph. More precisely, this is the number of non-empty subsets of the set of vertices of a graph, such that the induced subgraph is connected.