Advertisement Jump to content
Sign in to follow this  
Jonny CW Liu

Complete bipartile graph - how to find number of paths of length n?!

This topic is 1865 days old which is more than the 365 day threshold we allow for new replies. Please post a new topic.

If you intended to correct an error in the post then please contact us.

Recommended Posts

How many paths of length 5 are there in the complete bipartite graph K3,7? (Remember that a path such as v1 ? v2 ? v3 ? v4 ? v5 ? v6 is considered to be the same as the path v6 ? v5 ? v4 ? v3 ? v2 ? v1)

Hey guys so i was asked this question...could anyone help me? It would be great if there was a method explained too to how to obtain the answer since i got asked of shorter lengths too... Thx a lot!

Share this post


Link to post
Share on other sites
Advertisement
3*7*2*6*1*5

Just go through the process of building a path and count how many choices you have at each step.

Share this post


Link to post
Share on other sites
Sign in to follow this  

  • Advertisement
×

Important Information

By using GameDev.net, you agree to our community Guidelines, Terms of Use, and Privacy Policy.

GameDev.net is your game development community. Create an account for your GameDev Portfolio and participate in the largest developer community in the games industry.

Sign me up!