arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1806.02122math.GR
收藏

与有限群相关的幂图的复杂性

The Complexity of Power Graphs Associated With Finite Groups

S. Kirkland, A. R. Moghaddamfar, S. Navid Salehy, S. Nima Salehy, M. Zohourattar

摘要:

有限群$G$的幂图$\mathcal{P}(G)$是顶点集为$G$的图,并且如果$G$中的两个元素之一是另一个的幂,则它们相邻。本文件有两个目的。首先,我们给出了团替换图的复杂性及其应用。其次,我们对$G$阶的循环群、单群$L_2(q)$、特殊$p$ --$p^3$、弗罗贝尼乌斯群等,导出了有关$G$的复杂性$κ(\mathcal{P}(G))$的显式公式。

英文摘要:

The power graph $\mathcal{P}(G)$ of a finite group $G$ is the graph whose vertex set is $G$, and two elements in $G$ are adjacent if one of them is a power of the other. The purpose of this paper is twofold. First, we find the complexity of a clique--replaced graph and study some applications. Second, we derive some explicit formulas concerning the complexity $κ(\mathcal{P}(G))$ for various groups $G$ such as the cyclic group of order $n$, the simple groups $L_2(q)$, the extra--special $p$--groups of order $p^3$, the Frobenius groups, etc.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑