On chordality of the power graph of finite groups
Group Theory
2023-10-09 v2 Combinatorics
Abstract
A graph is called chordal if it forbids induced cycles of length 4 or more. In this paper, we attempt to identify the non-nilpotent groups whose power graph is a chordal graph (this question was raised by Cameron in [4]). In this direction, we characterise the direct product of finite groups having chordal power graphs. We classify all finite simple groups of Lie type whose power graph is chordal. Further, we prove that the power graph of a sporadic simple group is always non-chordal. In addition, we show that almost all groups of order up to 47 have chordal power graphs.
Keywords
Cite
@article{arxiv.2208.14879,
title = {On chordality of the power graph of finite groups},
author = {Pallabi Manna and Ranjit Mehatari},
journal= {arXiv preprint arXiv:2208.14879},
year = {2023}
}