- FindStat

edit this statistic or download as text // json

Identifier

St000379: Graphs ⟶ ℤ

Values

([],2) => 0

([(0,1)],2) => 0

([],3) => 0

([(1,2)],3) => 0

([(0,2),(1,2)],3) => 0

([(0,1),(0,2),(1,2)],3) => 1

([],4) => 0

([(2,3)],4) => 0

([(1,3),(2,3)],4) => 0

([(0,3),(1,3),(2,3)],4) => 0

([(0,3),(1,2)],4) => 0

([(0,3),(1,2),(2,3)],4) => 0

([(1,2),(1,3),(2,3)],4) => 0

([(0,3),(1,2),(1,3),(2,3)],4) => 0

([(0,2),(0,3),(1,2),(1,3)],4) => 1

([(0,2),(0,3),(1,2),(1,3),(2,3)],4) => 1

([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4) => 3

([],5) => 0

([(3,4)],5) => 0

([(2,4),(3,4)],5) => 0

([(1,4),(2,4),(3,4)],5) => 0

([(0,4),(1,4),(2,4),(3,4)],5) => 0

([(1,4),(2,3)],5) => 0

([(1,4),(2,3),(3,4)],5) => 0

([(0,1),(2,4),(3,4)],5) => 0

([(2,3),(2,4),(3,4)],5) => 0

([(0,4),(1,4),(2,3),(3,4)],5) => 0

([(1,4),(2,3),(2,4),(3,4)],5) => 0

([(0,4),(1,4),(2,3),(2,4),(3,4)],5) => 0

([(1,3),(1,4),(2,3),(2,4)],5) => 0

([(0,4),(1,2),(1,3),(2,4),(3,4)],5) => 0

([(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 0

([(0,4),(1,3),(2,3),(2,4),(3,4)],5) => 0

([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 0

([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5) => 0

([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 0

([(0,4),(1,3),(2,3),(2,4)],5) => 0

([(0,1),(2,3),(2,4),(3,4)],5) => 0

([(0,3),(1,2),(1,4),(2,4),(3,4)],5) => 0

([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5) => 0

([(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) => 1

([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5) => 1

([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5) => 0

([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 0

([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 0

([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 2

([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5) => 2

([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5) => 4

([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 6

([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 12

([],6) => 0

([(4,5)],6) => 0

([(3,5),(4,5)],6) => 0

([(2,5),(3,5),(4,5)],6) => 0

([(1,5),(2,5),(3,5),(4,5)],6) => 0

([(0,5),(1,5),(2,5),(3,5),(4,5)],6) => 0

([(2,5),(3,4)],6) => 0

([(2,5),(3,4),(4,5)],6) => 0

([(1,2),(3,5),(4,5)],6) => 0

([(3,4),(3,5),(4,5)],6) => 0

([(1,5),(2,5),(3,4),(4,5)],6) => 0

([(0,1),(2,5),(3,5),(4,5)],6) => 0

([(2,5),(3,4),(3,5),(4,5)],6) => 0

([(0,5),(1,5),(2,5),(3,4),(4,5)],6) => 0

([(1,5),(2,5),(3,4),(3,5),(4,5)],6) => 0

([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6) => 0

([(2,4),(2,5),(3,4),(3,5)],6) => 0

([(0,5),(1,5),(2,4),(3,4)],6) => 0

([(1,5),(2,3),(2,4),(3,5),(4,5)],6) => 0

([(0,5),(1,5),(2,3),(3,4),(4,5)],6) => 0

([(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 0

([(1,5),(2,4),(3,4),(3,5),(4,5)],6) => 0

([(0,5),(1,5),(2,4),(3,4),(4,5)],6) => 0

([(0,5),(1,5),(2,3),(2,4),(3,5),(4,5)],6) => 0

([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 0

([(0,5),(1,5),(2,4),(3,4),(3,5),(4,5)],6) => 0

([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 0

([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6) => 0

([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6) => 0

([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6) => 0

([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 0

([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 0

([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 0

([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6) => 0

([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 0

([(0,5),(1,4),(2,3)],6) => 0

([(1,5),(2,4),(3,4),(3,5)],6) => 0

([(0,1),(2,5),(3,4),(4,5)],6) => 0

([(1,2),(3,4),(3,5),(4,5)],6) => 0

([(0,5),(1,4),(2,3),(3,5),(4,5)],6) => 0

([(1,4),(2,3),(2,5),(3,5),(4,5)],6) => 0

([(0,1),(2,5),(3,4),(3,5),(4,5)],6) => 0

([(0,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6) => 0

([(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6) => 0

([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6) => 0

([(1,4),(1,5),(2,3),(2,5),(3,4)],6) => 0

([(0,5),(1,4),(2,3),(2,4),(3,5),(4,5)],6) => 0

([(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6) => 0

([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6) => 0

([(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6) => 0

>>> Load all 1199 entries. <<<

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 Hamiltonian cycles in a graph.
A Hamiltonian cycle in a graph $G$ is a subgraph (this is, a subset of the edges) that is a cycle which contains every vertex of $G$.
Since it is unclear whether the graph on one vertex is Hamiltonian, the statistic is undefined for this graph.

References

[1] wikipedia:Hamiltonian_path
[2] WolframAlpha:FindHamiltonianCycle

Code

def statistic(g):
    n = len(g.vertices())
    if n < 2:
        return
    if n == 2:
        return 0
    return g.subgraph_search_count(graphs.CycleGraph(n))/(2*n)

Created

Feb 07, 2016 at 12:42 by Christian Stump

Updated

Mar 31, 2019 at 22:50 by Martin Rubey