6 votes 6 votes Consider the following graph. How many paths of length $4$ exist from node $A$ to node $D$? (Note: The path may have repeated vertices. You can think of it as walks in general rather than path) Discrete Mathematics go-mockgate-1 discrete-mathematics graph-theory graph-connectivity numerical-answers + – Ruturaj Mohanty asked Dec 27, 2018 recategorized Sep 10, 2020 by ajaysoni1924 Ruturaj Mohanty 3.2k views answer comment Share Follow See all 8 Comments See all 8 8 Comments reply Show 5 previous comments Ruturaj Mohanty commented Jan 1, 2019 reply Follow Share Yes i made the paper lengthy as you are in home in your comfort zone. In real gate environment changes. Even easiest of questions seems difficult. Disturbances are there too. Anyways your score is really good. Keep it up !!! 5 votes 5 votes Magma commented Jan 1, 2019 reply Follow Share This is basically a walk as Ruturaj Mohanty because in path no vertices can be repeated and here if we find the path of length 4 we visit the node more than once now 2 x 2 x 2 = 8 ways ?? 4 votes 4 votes Shashi Shekhar 1 commented Jan 5, 2019 reply Follow Share answer is 8. 0 votes 0 votes Please log in or register to add a comment.
Best answer 4 votes 4 votes Adjacency matrix A= $A^4$ = Number of paths/ walks ($A^4$ [1][4]) = 8 gmrishikumar answered Jan 30, 2019 selected Jan 30, 2019 by Ruturaj Mohanty gmrishikumar comment Share Follow See all 0 reply Please log in or register to add a comment.