检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]School of Mathematical Sciences, Guangxi Teachers Education University Nanning 530023, China [2]School of Mathematics, South China Normal University Guangzhou 510631, China
出 处:《Algebra Colloquium》2014年第2期317-330,共14页代数集刊(英文版)
基 金:Supported by NSF of China (Grant No. 11271142) and the Guangdong Provincial Natural Science Foundation (Grant No. $2012010009942).
摘 要:Let H be an abelian group written additively and k be a positive integer. Let G(H,k) denote the digraph whose set of vertices is just H, and there exists a directed edge from a vertex a to a vertex b if b = ka. In this paper we give a necessary and sumcient condition for G(H, k1) ≈ G(H, k2). We also discuss the problem when G(H1, k) is isomorphic to G(H2, k) for a given k. Moreover, we give an explicit formula of G(H, k) when H is a p-group and gcd(p, k) = 1.Let H be an abelian group written additively and k be a positive integer. Let G(H,k) denote the digraph whose set of vertices is just H, and there exists a directed edge from a vertex a to a vertex b if b = ka. In this paper we give a necessary and sumcient condition for G(H, k1) ≈ G(H, k2). We also discuss the problem when G(H1, k) is isomorphic to G(H2, k) for a given k. Moreover, we give an explicit formula of G(H, k) when H is a p-group and gcd(p, k) = 1.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.198