a graph G that is a line on n vertices. (That is, the vertices are labelled 1 to n, and there is an edge from 1 to 2, 2 to 3, etc.
View the step-by-step solution to:

Question

a graph G that is a line on n vertices. (That is, the vertices are labelled 1 to n, and there is an edge from 1 to

2, 2 to 3, etc.)


if we have a simple graph like the one described, how could i find and prove the number of INDEPENDENT sets contained in graph G (I.E. so there is not an edge connecting the two vertices) for each set (I.E. INDEPENDENT)? I want to find a general answer in terms of n (i.e "For n vertices the number of independent sets is the nth prime.")


Thank you!


I have found the forumula  3n/3 to calculate the max number of independent sets on a graph, but I'm not sure how or why this is true.

Recently Asked Questions

Why Join Course Hero?

Course Hero has all the homework and study help you need to succeed! We’ve got course-specific notes, study guides, and practice tests along with expert tutors.

  • -

    Study Documents

    Find the best study resources around, tagged to your specific courses. Share your own to gain free Course Hero access.

    Browse Documents
  • -

    Question & Answers

    Get one-on-one homework help from our expert tutors—available online 24/7. Ask your own questions or browse existing Q&A threads. Satisfaction guaranteed!

    Ask a Question
Ask Expert Tutors You can ask You can ask ( soon) You can ask (will expire )
Answers in as fast as 15 minutes