|
| |
|
|
A078780
|
|
Number of different digraphs on an n-cube.
|
|
0
| | |
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| 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: A185320 A196458 A085522 * A041377 A103499 A199834
Adjacent sequences: A078777 A078778 A078779 * A078781 A078782 A078783
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Roderick Edwards (edwards(AT)math.uvic.ca), Jan 09 2003
|
| |
|
|
