Affiliation:
1. Dipartimento di Matematica “Tullio Levi-Civita” , Università degli Studi di Padova , Padova , Italy
Abstract
Abstract
Given a finite group G, the invariably generating graph of G is defined as the undirected graph in which the vertices are the nontrivial conjugacy classes of G, and two classes are adjacent if and only if they invariably generate G.
In this paper, we study this object for alternating and symmetric groups.
The main result of the paper states that if we remove the isolated vertices from the graph, the resulting graph is connected and has diameter at most 6.
Subject
Algebra and Number Theory
Reference16 articles.
1. T. M. Apostol,
Introduction to Analytic Number Theory,
Undergrad. Texts Math.,
Springer, New York, 1976.
2. J. Araújo, J. P. Araújo, P. J. Cameron, T. Dobson, A. Hulpke and P. Lopes,
Imprimitive permutations in primitive groups,
J. Algebra 486 (2017), 396–416.
3. T. Breuer, R. M. Guralnick and W. M. Kantor,
Probabilistic generation of finite simple groups. II,
J. Algebra 320 (2008), no. 2, 443–494.
4. T. C. Burness, M. W. Liebeck and A. Shalev,
Generation of second maximal subgroups and the existence of special primes,
Forum Math. Sigma 5 (2017), Article ID e25.
5. J. D. Dixon,
Random sets which invariably generate the symmetric group,
Discrete Math. 105 (1992), no. 1–3, 25–39.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献