2000 character limit reached
Forbidden subgraphs in enhanced power graphs of finite groups
Published 10 Apr 2021 in math.CO | (2104.04754v5)
Abstract: The enhanced power graph of a group is the simple graph whose vertex set is consisted of all elements of the group, and whose any pair of vertices are adjacent if they generate a cyclic subgroup. In this paper, we classify all finite groups whose enhanced power graphs are split and threshold. We also classify all finite nilpotent groups whose enhanced power graphs are chordal graphs and cographs. Finally, we give some families of non-nilpotent groups whose enhanced power graphs are chordal graphs and cographs. These results partly answer a question posed by Peter J. Cameron.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.