Is there an easy way to obtain with Sage the following for a given n:
All connected Digraphs (up to isomorphism) with n points whose underlying undirected graph is a tree?
Revision history [back]
 | 1 | initial version |
Digraphs with Sage
| | 2 | None |
Digraphs with Sage
Is there an easy way to obtain with Sage the following for a given n:
All connected Digraphs (up to isomorphism) with n points whose underlying undirected graph is a tree?tree (simply-laced)?
