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

有限群幂图的Szeged指数

The Szeged Index of Power Graph of Finite Groups

JIS University(JIS大学)

Subarsha Banerjee

AI总结:

本文推导了图的广义联图Szeged指数公式,得到了n>2时有限循环群ℤₙ幂图的Szeged指数,建立了其与二面体群Dₙ幂图Szeged指数的关系,并提供了相应的SAGE计算代码。

摘要:

图的Szeged指数是一种在化学领域有诸多应用的不变量。有限群$G$的幂图是以$G$为顶点集的图,若存在$m,n\in \mathbb{N}$使得$v=u^m$或$u=v^n$,则两个顶点$u$和$v$相邻。本文首先推导了图的广义联图的Szeged指数计算公式。作为应用,我们得到了任意$n>2$时有限循环群$\mathbb Z_n$幂图的Szeged指数。进一步,我们建立了$\mathbb Z_n$幂图的Szeged指数与二面体群$\mathrm{D}_n$幂图的Szeged指数之间的关系。文末还提供了用于计算$\mathbb{Z}_n$和$\mathrm{D}_n$幂图Szeged指数的SAGE代码。

英文摘要:

The Szeged index of a graph is an invariant with several applications in chemistry. The power graph of a finite group $G$ is a graph having vertex set as $G$ in which two vertices $u$ and $v$ are adjacent if $v=u^m$ or $u=v^n$ for some $m,n\in \mathbb{N}$. In this paper, we first obtain a formula for the Szeged index of the generalized join of graphs. As an application, we obtain the Szeged index of the power graph of the finite cyclic group $\mathbb Z_n$ for any $n>2$. We further obtain a relation between the Szeged index of the power graph of $\mathbb Z_n$ and the Szeged index of the power graph of the dihedral group $\mathrm{D}_n$. We also provide SAGE codes for evaluating the Szeged index of the power graph of $\mathbb{Z}_n$ and $\mathrm{D}_n$ at the end of this paper.

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

↑