Question

7.5 (i) Prove that, if G is a bipartite graph with an odd number of vertices, then G is non-Hamiltonian. (ii) Deduce that the graph in Fig. 7.7 is non-Hamiltonian. Fig. 7.7 (iii) Show that, if n is odd, it is not possible for a knight to visit all the squares of an n chessboard exactly once by knight's moves and return to its starting point.

Answer 1

Ans D Let a biparite graph wth odd numbey ol vertic G is vertices claim G is non- Hamiltoniam Given G a bipoegraph Since, bipatite grarh is agraph ohose vevhces can be divided in odisioink an nde pendentsets u&v s-t evey edge cennecs a vectex n one in bygrarh G is bipare ife every cycle o G has even denqh a Hamitonian ojcle onlg exists on a biparhde G is bipavide graph uoith an odd number Fn "АЖ7-2· 13 veržices) .ohich is odd Consid Y nm enessbocơd celisare colored black 4 uhite visit ceLl dne Square o αγ Y1XT) . chessb@ge i.e. knight moves it chamges color e& its cell : Each Hamiltenian kht cyde on the che ss board has an equal num bes blaek andcohite cells so,津such a cycLeexỉsdS then dne chess board algo hos fmis odd, if is not possible for a knight o visit ai ờnv squaros ㅇ옹 an nrnchessboord exaoHy once by khight's moves