Forbidden subgraphs in reduced power graphs of finite groups

Forbidden subgraphs in reduced power graphs of finite groups

Let G be a finite group. The reduced power graph of G is the undirected graph whose vertex set consists of all elements of G, and two distinct vertices x and y are adjacent if either ⟨x⟩⊂⟨y⟩ or ⟨y⟩⊂⟨x⟩. In this paper, we show that the reduced power graph of G is perfect and characterize all finite g...

Full description

Bibliographic Details
Main Authors: Huani Li, Ruiqin Fu, Xuanlong Ma
Format: Article
Language:English
Published: AIMS Press 2021-03-01
Series:AIMS Mathematics
Subjects:
reduced power graph
split graph
cograph
chordal graph
threshold graph
abelian group
Online Access:http://www.aimspress.com/article/doi/10.3934/math.2021319?viewType=HTML

Internet

http://www.aimspress.com/article/doi/10.3934/math.2021319?viewType=HTML

Similar Items