Let G be a 3 regular graph on 100 vertices. What is the number of path's (v1, v2,...,v10) in G?
I have a hard time understanding graphs and I am not sure how to count the number of distinct paths of that desired length, in this case 10. Also from the formula I have found that G has 150 edges [(d*n/2) or (3x100/2)]. Any suggestions about where to go from here would be excellent. I have seen questions like this all my life and have never fully understood how to solve problems like this. I would like to put my curiosity to rest. Thanks in advance!