A130756 Number of minimally strongly connected digraphs on n vertices, up to isomorphism.

1, 1, 2, 5, 15, 63, 288, 1526, 8627, 52021, 328432, 2160415

Offset

1,3

Comments

A graph is strongly connected if there exists a directed path from any vertex to any other and minimally strongly connected if removing any edge destroys this property.

References

Kiran Kumar Bhogadi, Decomposition and Generation of Minimal Strongly Connected Digraphs.

Links

Table of n, a(n) for n=1..12.

Crossrefs

Cf. A000055.

Sequence in context: A030807 A030837 A143872 * A078793 A201702 A202037

Adjacent sequences: A130753 A130754 A130755 * A130757 A130758 A130759

Keyword

nonn

Author

Jack W Grahl, Jul 04 2007

Extensions

More terms from Vladeta Jovovic, Jul 13 2007

Status

approved