| K_(1.3)—Free图成为哈米顿的一个邻域并条件 |
| |
| 引用本文： | 李饶.K_(1.3)—Free图成为哈米顿的一个邻域并条件[J].辽宁石油化工大学学报,1992(1). |
| |
| 作者姓名： | 李饶 |
| |
| 作者单位： | 抚顺石油学院基础部 |
| |
| 摘 要： | 在本文中,我们给出下列定理:设G为阶是n≥3的2—连通,K_(13)—free图且满足NC(G)≥n—δ—2。则G为哈米顿的,这里NC(G)=min{|N(u)N(v)|E}。
|
| 关 键 词： | K_(1.3)—free图 哈米顿的 邻城并 |
A Neighborhood Union Condition for K_(1.3)—Free Graphs to Be Hamiltonian |
| |
| U Rao.A Neighborhood Union Condition for K_(1.3)—Free Graphs to Be Hamiltonian[J].Journal of Liaoning University of Petroleum & Chemical Technology,1992(1). |
| |
| Authors: | U Rao |
| |
| Abstract: | In this paper, we present the following theorem: Let G be a 2-connected, K_(1.3)-free graph with n≥3 vertices such that AC(G)≥n -δ-2.Then G is Hamiltonian. Where NC(G)=min{|N(u)ON(v)||uvE}. |
| |
| Keywords: | K_(1 3)-free graphs Hamiltonian Neighborhood unions |
| 本文献已被 CNKI 等数据库收录！ |
