有限群的相对g-非交换图
Relative g-noncommuting graph of finite groups
摘要:
设$G$是有限群.对于$G$中的固定元素$g$和$G$的给定子群$H$,如果$x \in H$或$y \in H$和$[x,y] \neq g, g^{-1}$,则$G$的相对$g$ -非交换图是顶点集为$G$且两个顶点$x$和$y$相邻的简单无向图.我们用$Γ_{H, G}^g$表示该图。本文给出了$Γ_{H, G}^g$中任意点的度的计算公式,刻画了$Γ_{H, G}^g$是树、星图、棒棒糖图还是完全图,以及$Γ_{H, G}^g$涉及图的同构的一些性质.给出了$Γ_{H, G}^g$的边数与$G$的广义交换概率之间的关系,并给出了$Γ_{H, G}^g$的边数的计算公式.最后,我们通过推导$Γ_{H, G}^g$中边数的界来总结本文。
英文摘要:
Let $G$ be a finite group. For a fixed element $g$ in $G$ and a given subgroup $H$ of $G$, the relative $g$-noncommuting graph of $G$ is a simple undirected graph whose vertex set is $G$ and two vertices $x$ and $y$ are adjacent if $x \in H$ or $y \in H$ and $[x,y] \neq g, g^{-1}$. We denote this graph by $Γ_{H, G}^g$. In this paper, we obtain computing formulae for degree of any vertex in $Γ_{H, G}^g$ and characterize whether $Γ_{H, G}^g$ is a tree, star graph, lollipop or a complete graph together with some properties of $Γ_{H, G}^g$ involving isomorphism of graphs. We also present certain relations between the number of edges in $Γ_{H, G}^g$ and certain generalized commuting probabilities of $G$ which give some computing formulae for the number of edges in $Γ_{H, G}^g$. Finally, we conclude this paper by deriving some bounds for the number of edges in $Γ_{H, G}^g$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。