- FindStat

edit this statistic or download as text // json

Identifier

St000344: Graphs ⟶ ℤ

Values

([],1) => 1

([],2) => 1

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

([],3) => 1

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

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

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

([],4) => 1

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

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

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

([],5) => 1

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

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

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

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

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

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

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

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

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

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

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

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

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

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

([],6) => 1

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

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

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

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

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

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

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

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

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

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

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

>>> Load all 1200 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 strongly connected outdegree sequences of a graph.
This is the evaluation of the Tutte polynomial at $x=0$ and $y=1$. According to [1,2], the set of strongly connected outdegree sequences is in bijection with strongly connected minimal orientations and also with external spanning trees.

References

[1] Gioan, E. Enumerating degree sequences in digraphs and a cycle–cocycle reversing system DOI:10.1016/j.ejc.2005.11.006
[2] Bernardi, O. Tutte polynomial, subgraphs, orientations and sandpile model: new connections via embeddings arXiv:math/0612003

Code

def statistic(g):
    return g.tutte_polynomial().subs(x=Integer(0),y=Integer(1))

Created

Dec 23, 2015 at 09:25 by Martin Rubey

Updated

Dec 23, 2015 at 10:13 by Martin Rubey