Let n 2 be an integer. Form a graph Gn whose vertices are all the two-element subsets of
Chapter 49, Problem 49.4(choose chapter or problem)
Let n 2 be an integer. Form a graph Gn whose vertices are all the two-element subsets of f1; 2; : : : ; ng. In this graph we have an edge between distinct vertices fa; bg and fc; dg exactly when fa; bg \ fc; dg D ;. Please answer: a. How many vertices does Gn have? b. How many edges does Gn have? c. For which values of n 2 is Gn connected? Prove your answer.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer