|
Search: id:A078780
|
|
|
| A078780 |
|
Number of different digraphs on an n-cube. |
|
+0
1
|
|
| 1, 4, 112, 11223994, 314824455746718261696, 136221825854745676520057815453547961471533176827330560
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
There are 2^(E(n)) directed graphs on the E(n)=n2^(n-1) edges of an n-cube, but many of these are equivalent under symmetries. This sequence gives the number of structurally different digraphs on the n-cube, i.e. the number of equivalence classes generated by the symmetries.
|
|
REFERENCES
|
R. Edwards and L. Glass. Combinatorial explosion in model gene networks, Chaos, Vol. 10 (2000), pp. 691-704.
|
|
CROSSREFS
|
Sequence in context: A013151 A006718 A085522 this_sequence A041377 A103499 A080482
Adjacent sequences: A078777 A078778 A078779 this_sequence A078781 A078782 A078783
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Roderick Edwards (edwards(AT)math.uvic.ca), Jan 09 2003
|
|
|
Search completed in 0.002 seconds
|
