If I have a directed acyclic graph (DAG) where I know the average out degree and the exact number of vertices, is there a counting equation to give me the expected number of paths?
Edit
Thanks for the feedback in the comments. I've added the following that I hope clarify my question.
- I'm looking for the total number of unique paths among all pairs of vertices.
- The average out degree over all vertices in the DAG is known, but the average out degree of any specific vertex is not known.