• anonymous
Let Sn;k;i be the graph whose vertex set V is the set of k-element subsets of f{1; 2;    ; n} and whose edge set E is the set of 2-element sets {A; B} with A ,B E V such that (A\B) = i. Find the number of edges in Sn;k;i and Find the value of r such that Sn;k;i is r-regular. (b) Let Kn be the complete graph with vertex set V = {1; 2;    ; n} whose edge set E is the set of all 2-element sets {a; b} with a; b 2 V . Find the number of subgraphs of Kn and nd the number of paths from 1 to n in Kn.
Mathematics
• Stacey Warren - Expert brainly.com
Hey! We 've verified this expert answer for you, click below to unlock the details :)
SOLVED
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.

Looking for something else?

Not the answer you are looking for? Search for more explanations.