The term (di)graph is employed to mean that a graph in question is either a directed graph or an undirected graph. The symbol G(p, r) represents the digraph defined by Chao[1]:V(G(p,r)) = Zp, E(G(p,r)) = {(x,y)|x - y ...The term (di)graph is employed to mean that a graph in question is either a directed graph or an undirected graph. The symbol G(p, r) represents the digraph defined by Chao[1]:V(G(p,r)) = Zp, E(G(p,r)) = {(x,y)|x - y ∈ Hr}, where p is a prime, r is a positive divisor of p - 1 and Hr is the unique subgroup of order r in Aut(Zp).展开更多
基金Project supported by the National Science Foundation of China under grant(No.103710003).
文摘The term (di)graph is employed to mean that a graph in question is either a directed graph or an undirected graph. The symbol G(p, r) represents the digraph defined by Chao[1]:V(G(p,r)) = Zp, E(G(p,r)) = {(x,y)|x - y ∈ Hr}, where p is a prime, r is a positive divisor of p - 1 and Hr is the unique subgroup of order r in Aut(Zp).
