|
|
A130756
|
|
Number of minimally strongly connected digraphs on n vertices, up to isomorphism.
|
|
1
|
|
|
1, 1, 2, 5, 15, 63, 288, 1526, 8627, 52021, 328432, 2160415
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
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
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|