若干H-局部连通图的路和圈问题.pdfVIP

(K ; 2)- K - ℄ 1,4 3 K - ℄ hamilton 2 2.1 ℄ G K - ℄ (K ; 2)- G[{x, y, z}] G 3 1,4 G[N (xyz)] 11. 2.2 ℄ G K - ℄ (K ; 2)- xy ∈ E (G), 2 1,4 P = x x ...x G[N (xy)] k ≤ 8. 1 2 k 2.3 ℄ G 5 K - ℄ (K ; 2)- G 2 1,4 hamilton P - ℄ 1-2 3 3.1 ℄ G P - ℄ G 1-2 3 [5,3]- P - ℄ 3 4.1 ≥ 8 P - ℄ [5,3]- 1-2 3 4.2 ≥ 10 P - ℄ [5,3]- 3 H- ℄Æ Hamilton; 1-2 Æ O157.5 2 Paths and Cycles in Several H-locally connected Graphs Huang Shasha School of Mathematical Sciences, Shandong Normal University Jinan, Shandong, 250014, P. R. China ABSTRACT Paths and cycles are two basic structures of graphs. Many practical problems can be attributed to the problem of paths and cycles. Therefore, The problem on paths and cycles of graphs is a very importantproblem in graph theory and the research is also active. What is more, the famous Hamilton problem belongs to the problem of paths and cycles of graphs in essence. Many scholars at home and abroad made a lot of research work on this issue. The research results and progress in this area can be found in literature[38]-[42]. The condition of degree and neighborhood unions becomes an