ON CAYLEY REPRESENTATIONS OF FINITE GRAPHS OVER ABELIAN p-GROUPS

被引:1
|
作者
Ryabov, G. [1 ,2 ]
机构
[1] Sobolev Inst Math, Novosibirsk, Russia
[2] Novosibirsk State Univ, Novosibirsk, Russia
基金
俄罗斯基础研究基金会;
关键词
Coherent configurations; Cayley graphs; Cayley graph isomorphism problem; ISOMORPHISM-PROBLEM;
D O I
10.1090/spmj/1639
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
A polynomial-time algorithm is constructed that, given a graph Gamma, finds the full set of nonequivalent Cayley representations of Gamma over the group D congruent to C-p X C-pk, where p is an element of {2, 3} and k >= 1. This result implies that the recognition and isomorphism problems for Cayley graphs over D can be solved in polynomial time.
引用
收藏
页码:71 / 89
页数:19
相关论文
共 50 条