Question: Let n Z+ with n 4, and let the vertex set V' for the complete graph Kn-1 be {v1, v2, v3, . .

Let n ∈ Z+ with n ≥ 4, and let the vertex set V' for the complete graph Kn-1 be {v1, v2, v3, . . . , vn-1}. Now construct the loop-free undirected graph Gn = (V, E) from Kn-1 as follows:
V = V' ∪ {v}, and E consists of all the edges in Kn-1 except for the edge {v1, v2}, which is replaced by the pair of edges {v1, v} and {v, v2}.
(a) Determine deg(x) + deg(y) for all nonadjacent vertices x and y in V.
(b) Does Gn have a Hamilton cycle?
(c) How large is the edge set E?
(d) Do the results in parts (b) and (c) contradict Corollary 11.6?

Step by Step Solution

3.54 Rating (185 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

a lf x v and y v then degx degy n 2 and degx degy 2n 4 ... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Document Format (1 attachment)

Word file Icon

954-M-L-A-L-S (8194).docx

120 KBs Word File

Students Have Also Explored These Related Linear Algebra Questions!