无向哈密顿图的一个充分必要条件及计算公式.pdfVIP

Computer Engineering and Applications 计算机工程与应用 2011 ，47 （14） 7 无向哈密顿图的一个充分必要条件及计算公式 1，2 1 侯爱民 ，郝志峰 HOU Aimin1，2 ，HAO Zhifeng1 1.华南理工大学 计算机科学与工程学院，广州 510006 2.东莞理工学院 计算机科学与技术系，广东 东莞 523808 1.College of Computer Science and Engineering ，South China University of Technology ，Guangzhou 510006 ，China 2.Department of Computer Science and Technology ，Dongguan University of Technology ，Dongguan ，Guangdong 523808 ，China HOU Aimin ，HAO Zhifeng.Sufficient and necessary condition for undirected Hamiltonian graph and its formula.Com- puter Engineering and Applications ，2011 ，47 （14）：7-9. Abstract ：As an NP-complete problem ，Hamiltonian graph problem is one of the main unresolved problems in graph theory. In 1968 Grinberg advanced a necessary condition for Hamiltonian planar graphs ，which enhanced the solution of non-Hamilto- nian planar graphs and led to a series of research work on 3-regular 3-connected non-Hamiltonian planar graphs.Based on the characteristic of undirected Hamiltonian graph ，some new notions about decomposition ，mergence and connection in com- mon edge of basic cycles ，as well as atomic cycle are defined.Any a connected simple undirected graph G is a Hamiltonian graph if and only if either the Hamiltonian cycle itself is an atomic cycle which contains every vertex of G or the Hamilto- nian cycle can always be decomposed into several atomic cycles which are connected with one another by one common edge in a certain order.A new necessary condition formula is derived from this sufficient and necessary condition which can deal with not only planar graphs but also non-planar graphs ，even more those planar graphs which can not be treated by Grinberg condition.Moreover ，experimental results