| 对称群上Cayley图的DNA计算 |
| |
| 引用本文： | 吴琼,王世英,杨爱民. 对称群上Cayley图的DNA计算[J]. 高校应用数学学报(A辑), 2004, 19(Z1): 582-592 |
| |
| 作者姓名： | 吴琼 王世英 杨爱民 |
| |
| 作者单位： | 1. 晋中学院,数学系,山西晋中,030600
2. 山西大学,数学科学学院,山西太原,030006 |
| |
| 基金项目： | Supported by Shanxi Province Science Foundation (20041002) and the National Natural ScienceFoundation of China(10471081). |
| |
| 摘 要： | 有一类图称为Cayley图或群图.猜想每个Cayley图都是Hamilton图.求Cayley图和有向Cayley图中的Hamilton圈和路自然产生在计算科学里.这篇文章研究了对称群上Cayley图的DNA计算和给出了求它的Hamilton圈的DNA算法.
|
| 关 键 词： | DNA计算 Cayley图 对称群 |
| 修稿时间： | 2004-07-08 |
DNA COMPUTING OF CAYLEY GRAPHS ON THE SYMMETRIC GROUP |
| |
| WU Qiong,WANG Shi-ying,YANG Ai-min. DNA COMPUTING OF CAYLEY GRAPHS ON THE SYMMETRIC GROUP[J]. Applied Mathematics A Journal of Chinese Universities, 2004, 19(Z1): 582-592 |
| |
| Authors: | WU Qiong WANG Shi-ying YANG Ai-min |
| |
| Affiliation: | WU Qiong1,WANG Shi-ying2,YANG Ai-min2 |
| |
| Abstract: | A class of graphs is called Cayley graphs or group graphs. It has been conjectured there is a Hamiltonian circuit in every Cayley graph. Thus,Hamiltonian circuits and paths in Cayley graphs and digraphs naturally arise in computer science. Every finite group is isomorphic to a subgroup of the symmetric group. In this paper,the DNA computing of Cayley graphs on the symmetric group is studied and the DNA algorithm for the Hamiltonian circuit problem is given. |
| |
| Keywords: | DNA computing Cayley praph symmetric group. |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
