Maximum number of path for simple acyclic directed graph with start and end node

jack1234

Say given a simple acyclic directed graph with n nodes , which includes a starting node s0 and ending node e0 (i.e., a kripke structure without loop)
what is the maximum number of path from s0 to e0?

bpet

The solution could be written in terms of powers of the (nilpotent) adjacency matrix.

Similar Threads for: Maximum number of path for simple acyclic directed graph with start and end node
Thread	Forum	Replies
Where to start on the path of enlightenment?(and other help)	General Discussion	15
Minimum number of edges in a graph of order n with chromatic number k	Set Theory, Logic, Probability, Statistics	1
Directed acyclic graph profit sorting	Set Theory, Logic, Probability, Statistics	3
Directed distance to a directed line	Precalculus Mathematics Homework	0
Scaling node coordinates to a fixed graph size	General Math	1

jack1234	Maximum number of path for simple acyclic directed graph with start and end node Tweet Say given a simple acyclic directed graph with n nodes , which includes a starting node s0 and ending node e0 (i.e., a kripke structure without loop) what is the maximum number of path from s0 to e0?

bpet	The solution could be written in terms of powers of the (nilpotent) adjacency matrix.