Question

=(V, En) 5. Let n1 be an integer and define the graph Gn as follows {0,1}", the set of all binary strings of length n. Vn = Two vertices x and y are connected by an edge emu if and only if x and y differs in exactly one position. (a) (4 points) Draw the graph Gn for n = 1,2,3 (b) (4 points) For a general n 2 1, find |Vn and |En (c) (10 points) Prove that for all integer n > 1, G2 has a Hamiltonian cycle

Answer 1

G 3 an be cause hre are O13 skrimgf over because degree of each sertex is n. E T-u 3

cyule C has no for na, n -has HamilQAoniay Cycde, Ghas Hamiltonpn aycle o O O Hamiltonian cy clo Suppase G- Then to Just as Hamltonian Cy Hamiltonian ccle, we havne to Padve teat Then Matomatical 1ndluctoy siQQ the eSulf. ad jacent be 2artex Let CA to ok equan zeros) n tae Hamltonjan Havuiltanian Cayele in Gyf Faliwrtmg Pate tuat goes from o all ertices of to teis a copgt Hamitonian minus the eolje from d from Pa-tli from сycle in Crk-i on) &en , +uen a 10- at Passes ro ot the form all vorticos and nally edge

Proof complates here We drave used due fact tiat GK as Hamilton cycle when uat tnere we assume Patu all vertices te form and o-pass1ng Patfrom &70ugw alU verties of tue formiz Tolustration G) Sart ere oo 1 11]