(k+1)-连通无K_(1,r)-图是Hamilton-连通的两个充分条件  

Two Sufficient Conditions for (k+1) Connected K 1,r free Graphs to be Hamilton connected

作　　者：詹明权[1,2] 徐新萍[1,2] 

机构地区：[1]南京市晓庄师范学校 [2]江苏教育学院数学系

出　　处：《辽宁大学学报（自然科学版）》1998年第4期301-308,共8页Journal of Liaoning University：Natural Sciences Edition

摘　　要：一个图若不含与Ｋ１，ｒ（ｒ３）同构的导出子图，则称它为无Ｋ１，ｒ－图．本文将运用Ｔ－插点方法，通过对图的独立集的邻域交的研究，给出（ｋ＋１）－连通无Ｋ１，ｒ－图（ｒ４）是Ｈａｍｉｌｔｏｎ－连通的两个充分条件．A graph is caued K 1,r free (r≥3) if it doesnt contain induced subgraph which is isomorphic to K 1,r . The technique of T insertion and neighborhood intersections of independent sets in a graph were used in this paper. The results showed two sufficient conditions that (k+1) connected K 1,r free giaphs were hamilton connedeh.

关 键 词：哈密顿连通 独立集 邻域交 连通图 充分条件 

分 类 号：O157.5[理学—数学]