The diameter of proper power graphs of alternating groups

MaRDI QIDQ5133109zbMATH OpenFDO

Authors Kobra Pourghobadi, Sayyed Heidar Jafari

Publication date 12 November 2020

Full work available at URL https://arxiv.org/abs/1901.07184

zbMATH Keywords

alternating groupsdiameterproper power graph

Mathematics Subject Classification ID

Distance in graphs (05C12) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Simple groups: alternating groups and groups of Lie type (20D06)

Abstract: The power graph of finite group G is a simple graph whose vertex set is G and two distinct elements a and b are adjacent if and only if one of them is a power of the other. The proper power graph of G is a graph which is obtained by deleting the identity vertex (the identity element of G). In this paper, we improve the diameter bound of proper power graph of alternating group of degree n which the graph is connected. We show that the diameter of An is between 6 and 11, if the n at least 51. We also describe a number of short paths in these power graphs.

Recommendations

• The diameter of power graphs of symmetric groups
• On the connectivity of proper power graphs of finite groups
• On some graphs associated with the finite alternating groups
• Some results in a new power graphs in finite groups
• The complement of proper power graphs of finite groups

Cited in

(4)

• On the connectivity of proper power graphs of finite groups
• On the generating graph of direct powers of a simple group.
• On some graphs associated with the finite alternating groups
• The diameter of power graphs of symmetric groups

This page was built for publication: The diameter of proper power graphs of alternating groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5133109)