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.
Kiran Kumar Bhogadi, Decomposition and Generation of Minimal Strongly Connected Digraphs.
Table of n, a(n) for n=1..12.
Sequence in context: A030807 A030837 A143872 * A078793 A201702 A202037
Adjacent sequences: A130753 A130754 A130755 * A130757 A130758 A130759
Jack W Grahl, Jul 04 2007
More terms from Vladeta Jovovic, Jul 13 2007