|
%I #6 Feb 01 2014 21:39:34
%S 1,1,2,5,15,63,288,1526,8627,52021,328432,2160415
%N Number of minimally strongly connected digraphs on n vertices, up to isomorphism.
%C 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.
%D Kiran Kumar Bhogadi, Decomposition and Generation of Minimal Strongly Connected Digraphs.
%Y Cf. A000055.
%K nonn
%O 1,3
%A _Jack W Grahl_, Jul 04 2007
%E More terms from _Vladeta Jovovic_, Jul 13 2007
|
