Graph Theory Chapter 8 Homiltonian Graphs图8章homiltonian图.pptVIP

Graph TheoryChapter 8 Hamiltonian Graphs 大葉大學 資訊工程系黃鈴玲 Outline 8.1 An Introduction to Hamiltonian Graphs 8.2 Which Graphs are Hamiltonian? 8.3 The Traveling Salesman Problem 8.1 An Introduction to Hamiltonian Graphs Definition: A graph of G is called Hamiltonian if G has a spanning cycle. Knight’s Tour Puzzle pf: (By induction on n) Base: (n=3) OK Inductive: Assume the (n-1)-cube is  hamiltonian. Consider the n-cube: Ex2: Show that the graph G below is  not hamiltonian. pf: G is hamiltonian ? ? a hamiltonian cycle C Suppose k(G-S) = n, where G1