ISOMORPHIC DIGRAPHS FROM POWERS MODULO p

被引：5

作者：

Deng, Guixin ^{[1
]}

Yuan, Pingzhi ^{[2
]}

机构：

[1] Sun Yat Sen Univ, Sch Math, Guangzhou 510275, Guangdong, Peoples R China

[2] S China Normal Univ, Sch Math, Guangzhou 510631, Guangdong, Peoples R China

来源：

CZECHOSLOVAK MATHEMATICAL JOURNAL | 2011年 / 61卷 / 03期

关键词：

congruence; digraph; component; height;

D O I：

10.1007/s10587-011-0025-y

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Let p be a prime. We assign to each positive number k a digraph G(p)(k) whose set of vertices is {1, 2, ... , p - 1} and there exists a directed edge from a vertex a to a vertex b if a(k) equivalent to b (mod p). In this paper we obtain a necessary and sufficient condition for G(p)(k1) similar or equal to G(p)(k2).

引用

页码：771 / 779

页数：9