Tell me more ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.
up vote 1 down vote favorite

I'm looking for a way to generate random connected directed acyclic graphs, where I can specify the number of vertices that have no outgoing edges (leaf vertices).

Anyone ever seen such a thing, or know how to generate such graphs?

Thanks.

share|improve this question
What do you mean by random in this context? – copper.hat May 7 '12 at 4:10
Basically, I provide the number of vertices, number of edges, and number of leaf vertices, and edges will be assigned randomly among the vertices. – Erich Peterson May 7 '12 at 4:20
The tag graph is intended for questions about graphs of functions, see the tag-wiki and the tag-excerpt. (The tag-excerpt is also shown when you are adding a tag to a question.) There is a separate tag for graph-theory. – Martin Sleziak Mar 23 at 6:30

Know someone who can answer? Share a link to this question via email, Google+, Twitter, or Facebook.

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.