有向循环图的同构 |
| |
引用本文: | 孟吉翔,黄琼湘.有向循环图的同构[J].高校应用数学学报(英文版),1994,9(4):405-409. |
| |
作者姓名: | 孟吉翔 黄琼湘 |
| |
摘 要: | Let S belong to Zn-{0}.The circulant digraph DCn(S) is a directed graph with vertex set Zn and are set {(i,i s):i∈Zn,s∈S},A.Adam conjectured that DCn(S)≌DCn(T) if and only if T=uS for some unit u mod n.In this paper we prove that the conjecture is true if S is a minimal generating set of Zn and thus determine the full automorphism groups of such digraphs.The methods we employ are new and easy to be understood.
|
关 键 词: | 有向循环图 自同构 图论 最小退化集 |
本文献已被 维普 等数据库收录! |
|