有限群$\mathcal{G}$的幂图记为$\mathcal{P}(\mathcal{G})$,是顶点集为$\mathcal{G}$且两个不同元素之间存在边的图$u, v \in \mathcal{G}$当且仅当对于某个$m \in \mathbb{N}$,$u^m = v$或$v^m = u$.根据距离的不同,Hosoya多项式包含了大量关于图不变量的知识,这些知识可以用来确定众所周知的化学描述符。图$Γ$的Hosoya指数是$Γ$中匹配的总数。本文计算了有限群幂图的Hosoya性质,包括Hosoya指数、Hosoya多项式及其倒数。
英文摘要:
The power graph denoted by $\mathcal{P}(\mathcal{G})$ of a finite group $\mathcal{G}$ is a graph with vertex set $\mathcal{G}$ and there is an edge between two distinct elements $u, v \in \mathcal{G}$ if and only if $u^m = v$ or $v^m = u$ for some $m \in \mathbb{N}$. Depending on the distance, the Hosoya polynomial contains a lot of knowledge about graph invariants which can be used to determine well-known chemical descriptors. The Hosoya index of a graph $Γ$ is the total number of matchings in $Γ$. In this article, the Hosoya properties of the power graphs associated with a finite group, including the Hosoya index, Hosoya polynomial, and its reciprocal are calculated.
Certain properties of the enhanced power graph associated with a finite group
有限群$G$的增强幂图,记作$\mathcal{P}_E(G)$,是顶点集为$G$且两个不同顶点$x, y$相邻的简单无向图,如果对某个$z \in G$有$x, y \in \langle z \rangle$.在这篇文章中,我们确定了所有有限群,使得$\mathcal{P}_E(G)$的最小度和点连通度相等。此外,我们分类的所有群体的(适当的)增强功率图是强正则的。进一步,得到了与某些幂零群相关的增强幂图的点连通性。最后,我们得到了$\mathcal{P}_E(G)$的Wiener指标的一个下界和一个上界,其中$G$是幂零群.达到这些界的有限幂零群幂零群也被刻画了。
A "power" conjugate equation in the symmetric group
First we consider the solutions of the general "cubic" equation a_{1} x^{r1} a_{2} x^{r2} a_{3} x^{r3}=1 (with r1,r2,r3 in {1,-1}) in the symmetric group S_{n} . In certain cases this equation can be rewritten as aya^{-1}=y^{2} or as aya^{-1}=y^{-2}, where a in S_{n} depends on the a_{i} 's and the new unknown permutation y in S_{n} is a product of x (or x^{-1}) and one of the permutations a_{i} ^{1} and a_{i} ^{-1}. Using combinatorial arguments and some basic number theoretical facts, we obtain results about the solutions of the so-called power conjugate equation aya^{-1}=y^{e} in S_{n} , wh…