Abstract
AbstractThe solubility graph $$\Gamma _S(G)$$
Γ
S
(
G
)
associated with a finite group G is a simple graph whose vertices are the elements of G, and there is an edge between two distinct vertices if and only if they generate a soluble subgroup. In this paper, we focus on the set of neighbors of a vertex x which we call the solubilizer of x in G, $$\mathrm {Sol}_G(x),$$
Sol
G
(
x
)
,
investigating both arithmetic and structural properties of this set.
Funder
Università degli Studi di Salerno
Publisher
Springer Science and Business Media LLC
Reference15 articles.
1. Akbari, B., Lewis, M.L., Mirzajani, J., Moghaddamfar, A.R.: The solubility graph associated with a finite group. Int. J. Algebra Comput. 30(8), 1555–1564 (2020)
2. Baumann, B.: Endliche nichtauflösbare Gruppen mit einer nilpotenten maximalen Untergruppe. J. Algebra 38, 119–135 (1976)
3. Burness, T.C., Lucchini, A., Nemmi, D.: On the soluble graph of a finite group. J. Comb. Theory Ser. A 194, 105708 (2023) arXiv:2111.05697
4. Feit, W., Thompson, J.G.: Finite groups which contain a self-centralizing subgroup of order $$3$$. Nagoya Math. J. 21, 185–197 (1962)
5. The GAP Group, GAP - Groups, Algorithms, and Programming, Version 4.12.2 (2022). https://www.gap-system.org. accessed 16 Feb 2023
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献