| 强哈密尔顿连通有向图的一个注记 |
| |
| 引用本文： | 张新鸿,李瑞娟,李胜家.强哈密尔顿连通有向图的一个注记[J].数学的实践与认识,2010,40(14). |
| |
| 作者姓名： | 张新鸿 李瑞娟 李胜家 |
| |
| 基金项目： | 山西省自然科学基金，太原科技大学青年基金 |
| |
| 摘 要： | 利用收缩技术,证明了1)阶为n=2k且最小半度至少是k的有向图D是强哈密尔顿连通的,除非D属于某些图类;2)2强连通且包含n个顶点、(n-1)(n-2)+4条弧的有向图是强哈密尔顿连通的,除非D属于某些图类.
|
| 关 键 词： | 收缩 强哈密尔顿连通 最小半度 |
A Note on Strongly Hamiltonian-Connected Digraphs |
| |
| ZHANG Xin-hong,LI Rui-juan,LI Sheng-jia.A Note on Strongly Hamiltonian-Connected Digraphs[J].Mathematics in Practice and Theory,2010,40(14). |
| |
| Authors: | ZHANG Xin-hong LI Rui-juan LI Sheng-jia |
| |
| Abstract: | Using the contraction technique,we prove that i) a digraph D of order n=2k with minimum semi-degree at least fc is strongly Hamiltonian-connected unless D is included in some exceptional classes of digraphs,and that ii) a 2-strong digraph D with n vertices and(n- l)(n-2)+4 arcs is strongly Hamiltonian-connected unless D belongs to some exceptional classes of digraphs. |
| |
| Keywords: | contraction strongly Hamiltonian-connected minimum semi-degree |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
