论文标题
增强组的功率图是弱完美的
Enhanced power graphs of groups are weakly perfect
论文作者
论文摘要
如果其集团数量和色数相等，则图是弱完美的。我们表明，有限组$ g $的增强功率图非常完美：其集团数字和色数等于$ g $的最大值。证明需要组合引理。我们给出了有关相关图的一些评论。
A graph is weakly perfect if its clique number and chromatic number are equal. We show that the enhanced power graph of a finite group $G$ is weakly perfect: its clique number and chromatic number are equal to the maximum order of an element of $G$. The proof requires a combinatorial lemma. We give some remarks about related graphs.
