The number of paths of length 4 in a graph

Graph Theory
Jesus A Jesus A
1
Report
  • M F H M F H
    0

    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.

    • M4Th6 M4Th6
      0

      This is also easy to guess as the first and the last path are b->a and a->b

Answer this question
Join Matchmaticians Affiliate Marketing Program to earn up to 50% commission on every question your affiliated users ask or answer.