Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A130756
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A130756 Number of minimally strongly connected digraphs on n vertices, up to isomorphism. +0
2
1, 1, 2, 5, 15, 63, 288, 1526, 8627, 52021, 328432, 2160415 (list; graph; listen)
OFFSET

1,3

COMMENT

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

Cf. A000055.

Adjacent sequences: A130753 A130754 A130755 this_sequence A130757 A130758 A130759

Sequence in context: A030807 A030837 A143872 this_sequence A078793 A031154 A090091

KEYWORD

nonn

AUTHOR

Jack Grahl (j.grahl(AT)ucl.ac.uk), Jul 04 2007

EXTENSIONS

More terms from Vladeta Jovovic (vladeta(AT)Eunet.yu), Jul 13 2007

page 1

Search completed in 0.006 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified October 7 14:39 EDT 2008. Contains 144666 sequences.


AT&T Labs Research