| 3-连通3-正则图中的可序子集 |
| |
| 引用本文： | 斯钦.3-连通3-正则图中的可序子集[J].数学的实践与认识,2008,38(8):151-157. |
| |
| 作者姓名： | 斯钦 |
| |
| 作者单位： | 内蒙古师范大学,数学科学学院,内蒙古,010022 |
| |
| 摘 要： | 图G的k元点集X={x1,x2,…,xk}被称为G的k-可序子集,如果X的任意排列都按序排在G的某个圈上.称G是k-可序图,如果G的每一个k元子集都是G的k-可序子集.称G为k-可序Hamilton图,如果X的任意排列都位于G的Hamilton圈上.研究了3-连通3-正则图的可序子集的存在性问题.
|
| 关 键 词： | 可序子集 k-可序Hamilton图 k-可序图 收缩 |
| 修稿时间： | 2005年10月12 |
Ordered Set in the 3-Connected and 3-Regular Graphs |
| |
| SI Qin.Ordered Set in the 3-Connected and 3-Regular Graphs[J].Mathematics in Practice and Theory,2008,38(8):151-157. |
| |
| Authors: | SI Qin |
| |
| Abstract: | A k-vertex set X={x1,x2,…,xk} in the graph G is said to be a k-ordered set,if for every complete permutation of X,there is a cycle of length larger than k in G that encounters the vertices in the order of sequence.A graph is said to be a k-ordered graph,if every k-vertex set is a k-ordered set in the graph.A graph G is said to be a k-ordered Hamiltonian graph,if every k-ordered set is in a Hamilton cycle in G.Existence problems in the 3-connected and 3-regular graph is studied in this paper. |
| |
| Keywords: | ordered set k-ordered hamiltonian graph k-ordered graph contraction |
| 本文献已被 万方数据 等数据库收录！ |
|
