|
Search: id:A139625
|
|
|
| A139625 |
|
Table read by rows: T(n,k) is the number of strongly connected directed multigraphs with loops and no vertex of degree 0, with n arcs and k vertices, which are transitive (the existence of a path between two points implies the existence of an arc between those two points). |
|
+0
5
|
|
| 1, 1, 1, 1, 1, 1, 2, 1, 6, 1, 10, 1, 19, 1, 28, 1, 1, 44, 2, 1, 60, 10, 1, 85, 31, 1, 110, 90, 1, 146, 222, 1, 182, 520, 1, 231, 1090, 1, 1, 280, 2180, 2, 1, 344, 4090, 11, 1
(list; graph; listen)
|
|
|
Search completed in 0.002 seconds
|
