On Cayley representations of finite graphs over Abelian 𝑝-groups,St. Petersburg Mathematical Journal

当前位置： X-MOL 学术 › St. Petersburg Math. J. › 论文详情

Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)

On Cayley representations of finite graphs over Abelian 𝑝-groups
St. Petersburg Mathematical Journal ( IF 0.8 ) Pub Date : 2021-01-11 , DOI: 10.1090/spmj/1639
G. Ryabov

Abstract: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\cong C_p\times C_{p^k}$ , where $p\in \{2,3\}$ and $k\geq 1$ . This result implies that the recognition and isomorphism problems for Cayley graphs over

can be solved in polynomial time.

中文翻译：

关于Abelian𝑝群上有限图的Cayley表示

摘要：构造了多项式时间算法，该算法给定一个图 $\伽玛$ ，找到 $\伽玛$ 该组，，和上整个非等价的Cayley表示集。这个结果表明，Cayley图的识别和同构问题可以在多项式时间内解决。 $D \ cong C_p \ times C_ {p ^ k}$ $p \ in \ {2,3 \}$ $k \ geq 1$

更新日期：2021-02-02

点击分享查看原文

点击收藏

公开下载

阅读更多本刊最新论文

全部期刊列表>>