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

有限群的差异子群图

The Difference Subgroup Graph of a Finite Group

Presidency University(总统大学)

Angsuman Das, Arnab Mandal, Labani Sarkar

AI总结:

本文首次系统研究有限群的差异子群图及其约化版本,建立了连通性条件、禁用子图刻画,并揭示图参数与群的可解性、幂零性之间的关系。

摘要:

有限群 $G$ 的差异子群图 $D(G)$ 定义为以 $G$ 的非平凡真子群为顶点的图,其中两个不同顶点 $H$ 和 $K$ 相邻当且仅当 $\langle H, K \rangle = G$ 但 $HK \ne G$。该图自然地产生于连接图 $Δ(G)$ 与共极大子群图 $Γ(G)$ 之间的差异。本文首次对 $D(G)$ 及其约化版本 $D^*(G)$(通过移除孤立顶点得到)展开系统研究。我们建立了这些图的若干基本结构性质,包括连通性条件、禁用子图刻画,以及独立数、团数和围长等图参数与底层群的可解性或幂零性之间的关系。文章最后讨论了未解决的问题和未来研究的潜在方向。

英文摘要:

The \emph{difference subgroup graph} $D(G)$ of a finite group $G$ is defined as the graph whose vertices are the non-trivial proper subgroups of $G$, with two distinct vertices $H$ and $K$ adjacent if and only if $\langle H, K \rangle = G$ but $HK \ne G$. This graph arises naturally as the difference between the join graph $Δ(G)$ and the comaximal subgroup graph $Γ(G)$. In this paper, we initiate a systematic study of $D(G)$ and its reduced version $D^*(G)$, obtained by removing isolated vertices. We establish several fundamental structural properties of these graphs, including conditions for connectivity, forbidden subgraph characterizations, and the relationship between graph parameters - such as independence number, clique number, and girth - and the solvability or nilpotency of the underlying group. The paper concludes with a discussion of open problems and potential directions for future research.

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

↑