arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2107.01157math.CO
收藏

有限群幂图中的匹配

Matching in power graphs of finite groups

Peter J. Cameron, V V Swathi, M S Sunitha

摘要:

有限群$G$的幂图$P(G)$是顶点集为$G$的无向单图,其中两个元素相邻,如果一个是另一个的幂。本文研究了有限群的幂图的匹配数。给出了群的幂图具有完美匹配的上、下界和条件。给出了有限幂零群的匹配数公式。此外,利用一些初等数论,我们证明了$G$的增强幂图$P_e(G)$(其中两个元素相邻,如果它们都是一个公共元素的幂)的匹配数等于$G$的幂图的匹配数.

英文摘要:

The power graph $P(G)$ of a finite group $G$ is the undirected simple graph with vertex set $G$, where two elements are adjacent if one is a power of the other. In this paper, the matching numbers of power graphs of finite groups are investigated. We give upper and lower bounds, and conditions for the power graph of a group to possess a perfect matching. We give a formula for the matching number for any finite nilpotent group. In addition, using some elementary number theory, we show that the matching number of the enhanced power graph $P_e(G)$ of $G$ (in which two elements are adjacent if both are powers of a common element) is equal to that of the power graph of $G$.

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

↑