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.
CROSSREFS
KEYWORD
nonn
AUTHOR
Jack W Grahl, Jul 04 2007
EXTENSIONS
More terms from Vladeta Jovovic, Jul 13 2007
STATUS
approved