The number of paths of length 4 in a graph
Join Matchmaticians Affiliate Marketing
Program to earn up to a 50% commission on every question that your affiliated users ask or answer.
- unanswered
- 264 views
- Pro Bono
Related Questions
- Characterizing the Infinitely Visited Intersections in a Ride-Forever Path on a Directed Graph
- Clock Problem
- Determine the number of perfect pairings in a complete bipartite graph Kn,n, in which n disjoint edges are removed.
- Graph Theory Question
- Prove that in 2-edge-connected graph, each vertex lies on a cycle.
- Discrete Math Question
- Determine the Closed Form of a Recurrance Relation
I can't see anything here but the title.... But I know that you get the paths of length 4 by taking the adjacency matrix to the 4th power.
This is also easy to guess as the first and the last path are b->a and a->b