Symmetric Digraphs from Powers Modulo <i>n</i>

• 作者: Guixin Deng Pingzhi Yuan
• 来源期刊: 离散数学期刊(英文)
• 学科: 数学
• 关键词: CONGRUENCE DIGRAPH Component Height Cycle
• 年，卷（期）: 2011,（3）
• 页码范围: 103-107
• 页数: 5页
• 分类号: O1

摘要

For each pair of positive integers n and k, let G(n,k) denote the digraph whose set of vertices is H = {0,1,2,···, n – 1} and there is a directed edge from a ∈ H to b ∈ H if a ≡ b(mod n). The digraph G(n,k) is symmetric if its connected component can be partitioned into isomorphic pairs. In this paper we obtain all symmetric G(n,k)