On power graphs of finite groups with forbidden induced subgraphs
On power graphs of finite groups with forbidden induced subgraphs
复制标题
DOI：
10.1016/j.indag.2014.01.003
复制
发表时间：
2014-01
期刊：
影响因子：
--
通讯作者：
A. Doostabadi;A. Erfanian;Mohammad Farrokhi Derakhshandeh Ghouchan
中科院分区：
文献类型：
--
作者：
A. Doostabadi;A. Erfanian;Mohammad Farrokhi Derakhshandeh Ghouchan
有限群G的幂图P（G）是这样一个图，其顶点集是群G，且不同元素x，y∈ G相邻，如果一个是另一个的幂，即x和y相邻，如果x∈< y>或y∈< x>.刻画了幂图无爪、无K1，4-或无C4-的有限群G。
The power graph P (G) of a finite group G is a graph whose vertex set is the group G and distinct elements x, y∈ G are adjacent if one is a power of the other, that is, x and y are adjacent if x∈< y> or y∈< x>. We characterize all finite groups G whose power graphs are claw-free, K 1, 4-free or C 4-free.