| ISOMORPHISMS OF CIRCULANT DIAGAPHS |
| |
| 引用本文： | MENG JIXIANG AND HUANG QIONGXIANG. ISOMORPHISMS OF CIRCULANT DIAGAPHS[J]. 高校应用数学学报(英文版), 1994, 9(4): 405-409. DOI: 10.1007/BF02665228 |
| |
| 作者姓名： | MENG JIXIANG AND HUANG QIONGXIANG |
| |
| 摘 要： | ＩＳＯＭＯＲＰＨＩＳＭＳＯＦＣＩＲＣＵＬＡＮＴＤＩＡＧＡＰＨＳＭＥＮＧＪＩＸＩＡＮＧＡＮＤＨＵＡＮＧＱＩＯＮＧＸＩＡＮＧＡｂｓｔｒａｃｔ：ＬｅｔＳＺｎ－｛０｝．ＴｈｅｃｉｒｃｕｌａｎｔｄｉｇｒａｐｈＤＣｎ（Ｓ）ｉｓａｄｉｒｅｃｔｅｄｇｒａｐｈｗｉｔｈ...
|
| 收稿时间： | 1993-03-31 |
Isomorphisms of circulant diagaphs |
| |
| Meng Jixiang and Huang Qiongxiang. Isomorphisms of circulant diagaphs[J]. Applied Mathematics A Journal of Chinese Universities, 1994, 9(4): 405-409. DOI: 10.1007/BF02665228 |
| |
| Authors: | Meng Jixiang and Huang Qiongxiang |
| |
| Affiliation: | MENG JIXIANG AND HUANG QIONGXIANG |
| |
| Abstract: | LetS⊂Z n−{0}. The circulant digraphDC n(S) is a directed graph with vertex setZ n and arc set {(i,i+s): i ∈ Z n, s ∈ S}. A. Adam conjectured thatDC n(S)≅DCn(T) if and only ifT=uS for some unitu modn. In this paper we prove that the conjecture is true ifS is a minimal generating set ofZ n and thus determine the full automorphism groups of such digraphs. The methods we employ are new and easy to be understood. Project Supported by NSFC. |
| |
| Keywords: | Isomorphism circulant digraph. |
| 本文献已被 CNKI SpringerLink 等数据库收录！ |
