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?
1 | initial version |
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?
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)?