Algebraic Cayley graphs over finite fields
Algebraic Cayley graphs over finite fields
复制标题
DOI：
10.1016/j.ffa.2014.01.014
复制
发表时间：
2013-03
期刊：
影响因子：
--
通讯作者：
Mei Lu;D. Wan;Li-Ping Wang;Xiaodong Zhang
中科院分区：
文献类型：
--
作者：
Mei Lu;D. Wan;Li-Ping Wang;Xiaodong Zhang
利用有限域构造了一个新的代数Cayley图。它提供了一个更灵活的扩展图源。通过对特征和的Weil估计，研究了其连通性、连接分量数和直径界。在此基础上，研究了计算连通分量数的算法问题，并与整数分解问题建立了联系。
A new algebraic Cayley graph is constructed using finite fields. It provides a more flexible source of expander graphs. Its connectedness, the number of connected components, and diameter bound are studied via Weil's estimate for character sums. Furthermore, we study the algorithmic problem of computing the number of connected components and establish a link to the integer factorization problem.