Non-solvable Groups whose Character Degree Graph has a Cut-Vertex. I

Let G be a finite group. Denoting by cd(G)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\textrm{cd}(G)$$\end{document} the set of degrees of the irreducible complex characters of G, we consider the character degree graph of G: this is the (simple undirected) graph whose vertices are the prime divisors of the numbers in cd(G)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\textrm{cd}(G)$$\end{document}, and two distinct vertices p, q are adjacent if and only if pq divides some number in cd(G)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\textrm{cd}(G)$$\end{document}. In the series of three papers starting with the present one, we analyze the structure of the finite non-solvable groups whose character degree graph possesses a cut-vertex, i.e. a vertex whose removal increases the number of connected components of the graph.


Introduction
Given a finite group G, let cd(G) = {χ(1) | χ ∈ Irr(G)} be the set of the degrees of the irreducible complex characters of G.This set has been extensively studied, on its own account as well as in relation to the structure of the group G.The character degree graph (or degree graph) ∆(G) is the simple undirected graph related to the set cd(G) as follows: the vertex set V(G) of ∆(G) consists of all the prime numbers dividing the degree of some irreducible character of G, and two distinct vertices p, q are adjacent in ∆(G) if and only if the product pq divides some irreducible character degree of G. Several results in the literature illustrate that graph-theoretical features of ∆(G) are significantly linked to the structure of G.For a detailed account on this subject, we refer to the expository paper [20].
As an important example, we mention that the number of connected components of ∆(G) is in general at most three ( [24]), and at most two if G is solvable.The structure of the finite groups whose degree graph is disconnected is described in [19] for the solvable case, and in [22] for the non-solvable case.
As a further step in the study of the connectivity properties of the degree graph, it is natural to consider the question about the existence of a cut-vertex, i.e. a vertex whose removal yields a resulting graph with more connected components than the original one.A graph that is connected and has a cutvertex is said to have connectivity degree 1, which is the smallest degree of connectivity of a connected graph.The finite solvable groups G such that ∆(G) has connectivity degree 1 are investigated in [21]; among other things, it is shown ([21, Theorem 1.1]) that in this case ∆(G) has a unique cut-vertex.
We also mention that the finite groups G whose degree graph ∆(G) has connectivity degree 1, and which satisfy the strong assumption (studied in [1], and implying non-solvability) that the complement graph of ∆(G) is non-bipartite, are described in [11].
In the series of three papers starting with the present one, we give a complete classification of all finite non-solvable groups whose degree graph has a cut-vertex (see Theorems A, B and C in Section 2).It turns out that the structure of the relevant groups, as well as of the corresponding degree graphs, is significantly restricted and, quite surprisingly, does not fall too far from the structure of the finite nonsolvable groups with a disconnected degree graph (see [22] or Theorem 3.7).As an interesting feature, we mention that in all cases (similarly to the situation for solvable groups) a degree graph ∆(G) with connectivity degree 1 has a unique cut-vertex (Corollary D).
The structure of the finite non-solvable groups whose character degree graph has connectivity degree 1 can be generally described as follows.Such a group G has a unique non-solvable composition factor S, belonging to the following short list of isomorphism types: PSL 2 (t a ), Sz(2 a ), PSL 3 (4), M 11 , J 1 ; moreover, if S ∼ = PSL 2 (t a ), then G has a (minimal) normal subgroup isomorphic to S (Theorem 4.1).Finally, denoting by R the solvable radical of G, the vertex set of ∆(G) consists exactly of the prime divisors of the order of the almost-simple group G/R and, if not already there, the cut-vertex of ∆(G) (Theorem 3.15).We also remark that in all cases, except possibly when the non-abelian simple section S is isomorphic to the Janko group J 1 , the cut-vertex p of ∆(G) is a complete vertex (i.e. it is adjacent to all other vertices) of ∆(G); moreover, the graph ∆(G) − p obtained from ∆(G) by removing the vertex p (and all the edges incident to p) has exactly two connected components, which are complete graphs.Rather remarkably, one of them consists of a single vertex, and hence our results give also a description of the finite non-solvable groups G such that ∆(G) has a cut-edge, i.e. an edge whose removal increases the number of connected components of the graph.
In Section 2 of this paper we present the complete statement of our main results Theorem A, Theorem B and Theorem C, as well as a discussion concerning the degree graphs associated to the relevant groups with some figures and comments.After another preliminary section, in Section 4 we prove Theorem A under the assumption that the non-abelian simple section S of the group is not isomorphic to a projective special linear group PSL 2 (t a ).The case S ∼ = PSL 2 (t a ) requires a much longer and rather technical analysis, which will be carried out in the forthcoming papers [8] and [9], where the proof of Theorem A and Theorem B will be completed.Finally, in Section 5 we prove Theorem C, which provides the classification the finite non-solvable groups G such that ∆(G) is not connected and has a cut-vertex, and that is rather directly derived from the classification in [22].
We close this introductory section by recalling that results about the degree graph of finite groups often have a counterpart concerning the prime graph built on the set of conjugacy class sizes of groups.The analogue of the problem here considered is studied in [10], where a classification of the finite groups whose prime graph on conjugacy class sizes has a cut-vertex is provided.However, the situation in that context turns out to be significantly different from the present one, since the relevant groups turn out to be solvable of Fitting heigth at most three and, moreover, there are cases in which the relevant graphs have two cut-vertices.
Not surprisingly, in this paper we use results that depend on the classification of the finite simple groups.Every group considered in the following discussion is tacitly assumed to be a finite group.

The classification
Given a group G, we denote by R = R(G) the solvable radical (i.e. the largest solvable normal subgroup), and by K = K(G) the solvable residual (i.e. the smallest normal subgroup with a solvable factor group) of G. Equivalently, K(G) is the last term of the derived series of G. Also, as customary, π(n) denotes the set of all prime divisors of a positive integer n, and we write π(G) for π(|G|).
This section is entirely dedicated to presenting the statement of the main theorems (Theorem A, Theorem B and Theorem C), the proof of which begins in the present paper as specified in the Introduction.The first two theorems treat the connected case, and can be regarded as two parts of the same result (in fact, they are stated separately only to improve clarity of the exposition and readability): the former deals with groups with no composition factors isomorphic to A 5 , whereas the latter covers the complementary situation.On the other hand, the disconnected case is analyzed in Theorem C. The rest of the section also presents the associated degree graphs, with some figures and comments.
In order to clarify the statements we also mention that, for H = SL 2 (t a ) (where t is a prime), an H-module V over the field F t with t elements is called the natural module for H if V is isomorphic to the standard module for SL 2 (t a ) (or any of its Galois conjugates) seen as an F t [H]-module.We will freely use this terminology also referred to the conjugation action of a group on a suitable elementary abelian normal subgroup.
Theorem A. Let G be a non-solvable group with no composition factors isomorphic to SL 2 (4) ∼ = A 5 , let R and K be, respectively, the solvable radical and the solvable residual of G, and let p be a prime number.Then the graph ∆(G) is connected and has cut-vertex p, if and only if G/R is an almost-simple group, V(G) = π(G/R) ∪ {p} and, denoting by S the socle of G/R, one of the following holds.
and V(R) ⊆ {2}.(e) S is isomorphic to PSL 2 (t a ), where t is an odd prime and t a > 5.In this case |G/KR| is not a multiple of t, p = t, and one of the following holds.
and L is the natural module for K/L; moreover, V(G/K) = {p}.(iii) t a = 13 and p = 2. K contains a minimal normal subgroup L of G such that K/L is isomorphic to SL 2 (13), and L is one of the two 6-dimensional irreducible modules for SL 2 (13) over , where a > 2, and one of the following holds.
and L is the natural module for K/L; also, G/KR has odd order, p = 2, V(G/K) = {p} and, for a Sylow 2-subgroup T of G, we have In all cases except in case (d) when R is abelian, p is is a complete vertex of ∆(G); furthermore, in all cases, p is the unique cut-vertex of ∆(G).
Theorem B. Let G be a (non-solvable) group having a composition factor isomorphic to SL 2 (4) ∼ = A 5 , let R and K be, respectively, the solvable radical and the solvable residual of G, and let p be a prime number.Then the graph ∆(G) is connected and has a cut-vertex p, if and only if G/R is an almost-simple group with socle isomorphic to SL 2 (4), V(G) = {2, 3, 5} ∪ {p}, and one of the following holds.
(a) K is isomorphic either to SL 2 (4) or to SL 2 (5), and 4 .Moreover, G = KR and (i) either L is the natural module for K/L, p = 2 and V(G/K) = {p}, (ii) or L is isomorphic to the restriction to K/L, embedded as (5), and (i) either L is the natural module for K/L, p = 5 and V(G/K) = {p}, (ii) or L is isomorphic to the restriction to K/L, embedded in SL 4 (3), of the standard module of SL 4 (3), p = 2 and V(G/K) ⊆ {2}.
In all cases, p is a complete vertex and the unique cut-vertex of ∆(G).
Finally, in order to complete the discussion, we provide a characterization of the non-solvable groups whose degree graph is disconnected and has a cut-vertex.
Theorem C. Let G be a non-solvable group, R the solvable radical of G, K the solvable residual of G and p a prime number.Then ∆(G) is a disconnected graph with cut-vertex p if and only if K is isomorphic to either PSL 2 (t a ) or SL 2 (t a ) (where t is a prime and t a ≥ 4), G/K is abelian, |G : KR| = p b with b ≥ 0, and one of the following holds.
(a) t is odd, p = 2, t a = 9 and t a is neither a Fermat nor a Mersenne prime.

Moreover, p is the unique cut-vertex and a complete vertex of ∆(G).
As a consequence of the above results and of Theorem 1.1 of [21] we have: Corollary D. For every group G, the degree graph ∆(G) has at most one cut-vertex.
As regards the (connected) graphs associated with the groups of Theorem A, they are represented in Table 1 except for those related to case (e) subcase (i), and to case (f) subcase (i) when p = 2 (note that the dashed edge represented in Table 1 case (d) is actually in the graph if and only if V(R) = {2}).For the two missing families of graphs we provide next a description.
Recall that, given two graphs Γ 1 and Γ 2 with vertex sets V(Γ 1 ) and V(Γ 2 ) respectively, the join of Γ 1 and Γ 2 is defined as the graph Γ 1 * Γ 2 whose vertex set is V(Γ 1 ) ∪ V(Γ 2 ), and two vertices are adjacent if and only if either one of them is in V(Γ 1 ) and the other one in V(Γ 2 ), or they are vertices of the same Γ i and they are adjacent in Γ i .Now, consider a group G as in case (e) subcase (i) of Theorem A, and adopt the notation of that theorem.Defining Γ 1 to be the complete graph whose vertex set is {2}∪π(G/KR), and Γ 2 to be the graph consisting of two complete connected components with vertex sets π(t a −1)−V(Γ 1 ) and π(t a +1)−V(Γ 1 ) respectively, it turns out that ∆(G/R) is a graph with two connected components: one of them consists of t only, whereas the other is Γ 1 * Γ 2 (this follows, for instance, from [30, Theorem A]).Given that, it is not difficult to see that ∆(G) is obtained starting from this ∆(G/R) and then connecting the vertex p (both if it is already in π(G/R) or not) with all the other vertices.
Similarly, if G is as in case (f) subcase (i) of Theorem A for p = 2, one defines Γ 1 to be the complete graph whose vertex set is π(G/KR), and Γ 2 to be the graph with two complete connected components of vertex sets π(2 a − 1) − V(Γ 1 ) and π(2 a + 1) − V(Γ 1 ) respectively.Then ∆(G/R) is as above (with 2 playing the role of t, of course) and ∆(G) is also obtained in the same way as above.
Moving to Theorem B, the graphs arising from it are displayed in Table 2 only in the case when the cut-vertex p is not already in the set π(G/R) = {2, 3, 5}.The missing graphs can be easily described: they are all the paths of length 2 with vertex set {2, 3, 5}.Of course there are three of them and they all occur: for instance, all these graphs occur as ∆(G) for G as in case (a) of Theorem B (it is enough to consider the direct product SL 2 (4) × R where R is a non-abelian q-group, for q ∈ {2, 3, 5}).It is also clear that case (b) subcase (ii) is associated to the path 2 − 5 − 3, and case (c) subcase (ii) to the path 3 − 2 − 5.
Finally, the (disconnected) graphs related to the groups of Theorem C are displayed in Table 3.     (clique)

Preliminaries
A simple undirected graph ∆ = (V, E) is defined by its vertex set V = V(∆) and its edge set E = E(∆), which is a subset of the set V [2] (consisting of the subsets of size 2 of V ).The graph ∆ is said to be complete if E = V [2] .When ∆ = ∆(G) is the degree graph of a group G, we will write V(G) for V(∆) and E(G) for E(∆).
A graph 0 ; we remark that an induced subgraph of ∆ is uniquely determined by the choice of its vertex set V 0 .For X ⊂ V , we denote by ∆ − X the subgraph of ∆ induced by the vertex set V − X (i.e. the subgraph obtained by 'deleting' the vertices in X and all the edges incident to them).If X = {v}, we simply write ∆ − v.
A graph ∆ is connected if every pair of vertices u and v is linked by a path in ∆.For k ≥ 0, ∆ is k-connected if |V(∆)| > k and ∆ − X is connected for every X ⊆ V such that |X| = k.The largest integer k such that ∆ is k-connected is called the connectivity degree of ∆.So, a disconnected graph has connectivity degree 0, while a graph ∆ has connectivity degree 1 if and only if |V(∆)| ≥ 2, ∆ is connected, and there exists a vertex v ∈ V(∆) such that ∆ − v is disconnected; in this case, v is called a cut-vertex of ∆.A vertex v of a graph ∆ is said to be complete if v is adjacent to every other vertex of ∆.It is easily seen that a graph with at least three vertices and that posseses at least two complete vertices is 2-connected.A complete subgraph is called a clique.We refer to [6] for further background in graph theory.
Throughout the paper some standard facts of character theory, such as Clifford correspondence, Gallagher's theorem, properties of character extensions (see [17]) and coprime actions (see [3]) will be used without references.
A basic result for the subject at hand, is the following consequence of the Ito-Michler's theorem, that describes the set of the vertices of the degree graph of a finite group.Proposition 3.1.Let G be a group and p a prime number.Then p ∈ V(G) if and only if G has a normal abelian Sylow p-subgroup.
We also mention that, as a consequence of Clifford theory, if H is isomorphic either to a normal subgroup or to a factor group of a group G (even more generally, to a subnormal section of G), then ∆(H) is a subgraph of ∆(G).
We recall that the character degree graphs of M 11 , J 1 and PSL 3 (4) are as follows ( [5]).Recall that, for a and n integers larger than 1, a prime divisor q of a n − 1 is called a primitive prime divisor if q does not divide a b − 1 for all 1 ≤ b < n.In this case, n is the order of a modulo q, so n divides q − 1.It is known ([25, Theorem 6.2]) that a n − 1 always has primitive prime divisors except when n = 2 and a = 2 c − 1 for some integer c, or when n = 6 and a = 2.
We will make use of the following well-known facts about linear groups.
Lemma 3.5.Let t be a prime number and a ≥ 2 an integer.Let p be a primitive prime divisor of t a − 1 and let X be a subgroup of G = GL a (t) such that |X| = p.Then C G (X) is a cyclic group of order t a − 1.
Proof.Let V be the natural module for G.We observe that, as p does not divide t b − 1 for every positive integer b < a, the subgroup X acts irreducibly on V .Hence, by Schur's lemma, the ring Lemma 3.6.For a positive integer a and a prime t, let G = GL 2a (t) and let Proof.Let C be a Singer cycle of L, so, |C| = t 2a − 1 and C is a maximal cyclic subgroup of G. Assume first that there exists a primitive prime divisor p of t 2a − 1.Hence, p divides |K| and we consider a subgroup If there is no primitive prime divisor of t 2a − 1, then either a = 1 and we are done as L = G, or t 2a = 2 6 and we can argue as above with a cyclic subgroup X of K such that |X| = 9.
As another important reference, we recall the characterization of the non-solvable groups whose character degree graph is disconnected ( [22]).Remark 3.8.Let G be a non-solvable group whose character degree graph ∆(G) has two connected components.Hence the structure of G is described by the conditions (a)-(f) in the above statement; observe also that (adopting the notation of Theorem 3.7) K = G ′ coincides with the last term in the derived series of G, whereas C coincides with the solvable radical R of G and N = K ∩ R.Then, we claim that the vertex set of ∆(G) consists of the primes in π(G/R).(Note that this claim is obviously true in the case when ∆(G) has three connected components, so it holds in fact whenever ∆(G) is disconnected.) In fact, since G/R is an almost-simple group, every prime in π(G/R) is a vertex of ∆(G/R), hence of ∆(G).On the other hand, let u be a prime that does not lie in π(G/R), and let U be a Sylow u-subgroup of G (which lies in R).Assume that G is as in (d) of Theorem 3.7 (so N = 1), in the case when there exists a minimal normal subgroup L of G such that K/L ∼ = SL 2 (t a ) and L is isomorphic to the natural module for K/L.Since R/N ∼ = KR/K ⊆ G/K is abelian, U N/N is abelian and normal in R/N , hence it is an abelian normal Sylow u-subgroup of G/N and, by Proposition 3.1, u ∈ V(G/N ) (note that, by this argument, our claim is proved if N is assumed to be trivial instead).As N/L is a central subgroup of order at most 2 of G/L, it is immediate to see that U L/L is abelian and normal in R/L (hence we are done if we are in case (d) with In particular, setting G = G/C G (L) and adopting the bar convention, we get [U , K] = 1 because obviously L ⊆ C G (L). Now G embeds in GL 2a (t), and K is a subgroup of G isomorphic to SL 2 (t a ): hence we are in a position to apply Lemma 3.6 obtaining that U must be trivial, because t a − 1 is a divisor of |G/R| and is therefore coprime with u.It easily follows that U is an abelian normal Sylow u-subgroup of G, so u ∈ V(G), and our claim is proved.
The following result will come into play later on.Theorem 3.9.Let G be an almost-simple group with socle S, and let δ = π(G) − π(S).If δ = ∅, then S is a simple group of Lie type, and every vertex in δ is adjacent to every other vertex of ∆(G) that is not the characteristic of S.
Proof.Assume δ = ∅ and let p ∈ δ.Since p divides |Aut(S)| but p does not divide |S|, by the classification of the finite simple groups we deduce that S is a simple group of Lie type in characteristic, say, t.By Theorem 2.7 of [27], p is adjacent in ∆(G) to every vertex q ∈ π(S) such that q = t.Moreover, G/S has a normal (in fact, central) and cyclic Hall δ-subgroup D/S ([27, Lemma 2.10]); so, by Schur-Zassenhaus theorem G has a cyclic Hall δ-subgroup A and by Lemma 2.6 of [27] A has a regular orbit on Irr(S).Hence, by Clifford correspondence, there is a χ ∈ Irr(G) such that |A| divides χ(1) and we conclude that, in particular, the subgraph of ∆(G) induced by δ is a clique.
To avoid any ambiguity in the previous statement, we mention that no simple group of Lie type in double characteristic has an outer automorphism whose order is coprime to the order of the group itself.
In the course of our analysis, we will also make use of special types of actions of groups on modules.Let H and V be finite groups, and assume that H acts by automorphisms on V .Given a prime number q, we say that the pair (H, V ) satisfies the condition N q if q divides |H : C H (V )| and, for every non-trivial v ∈ V , there exists a Sylow q-subgroup Q of H such that Q C H (v) (see [4]).
If (H, V ) satisfies N q then V turns out to be an elementary abelian r-group for a suitable prime r, and V is in fact an irreducible module for H over the field F r with r elements (see Lemma 4 of [32]).Lemma 3.10.Let t, q, r be prime numbers, let H = SL 2 (t a ) (with t a ≥ 4) and let V be an F r [H]-module.Then (H, V ) satisfies N q if and only if either t a = 5 and V is the natural module for H/C H (V ) ∼ = SL 2 (4) or V is faithful and one of the following holds. (1): Proof.First, we consider the "only if" part of the statement.If t = 2 = q, this is Proposition 13 of [4], while for t = 2 and q odd it follows from Lemma 3.3 of [1].We can therefore assume q = 2, thus also r = 2 by part (2) of Proposition 8 of [4].Next, we suppose that t is odd, and we prove that t a = 5 and that V is isomorphic to the natural module for H/C H (V ) ∼ = SL 2 (4).Observe that, by the condition N 2 , the kernel C H (V ) of the action is the cyclic subgroup Z(H) of order 2. Let T be a Sylow t-subgroup of H.If there exists a non-trivial element x ∈ T such that C V (x) = 1, then x normalizes a Sylow 2-subgroup of H by the condition N 2 : in view of the structure of the subgroups of PSL 2 (t a ) ( [16,Hauptsatz II.8.27]), this can happen only if t = 3.
Let us first assume t = 3. Hence T acts fixed-point freely on V and, as T is elementary abelian, it follows that a = 1.Let Q be a Sylow 2-subgroup of H.It is well known that Q is a generalized quaternion group (since H has a unique involution) and it easily follows that ).Now, if p is an odd divisor of t − 1, then H has a Frobenius subgroup T P , with kernel T and P cyclic of order p.By Theorem 15.16 of [17] C V (P ) is non-trivial and hence, again by the condition N 2 , P normalizes a Sylow 2-subgroup of H.It follows that either By (1), it follows that k = 2 and t = 5, so d = 4 (and b = 1).Of the two H-module of dimension 4 over F 2 , the only one that satisfies N 2 is the natural module for H/C H (V ) ∼ = SL 2 (4).
On the other hand, assume t = 3; so a ≥ 2 and a Sylow 3-subgroup of H, being non-cyclic, cannot act fixed-point freely on V .Since the normalizer of a Sylow 3-subgroup of H acts transitively on its subgroups of order 3, all the subgroups of order 3 of H are conjugate in H.It follows that each of them has a non-trivial centralizer in V and hence, by the condition N 2 and the discussion above, we deduce that a is odd and that C H (v) ∼ = SL 2 (3) for every non-trivial v ∈ V .In particular, all the H-orbits of non-trivial vectors of V have the same size (i.e.H acts 1  2 -transitively on V ).Hence, recalling that H is non-solvable and that the orbit sizes are odd by the condition N 2 , Theorem 6 of [15] yields that H acts transitively on the non-trivial elements of V .So, using the classification of the doubly transitive affine permutation groups (see Appendix 1 of [23]) and recalling that t = q (as t = 3 and q = 2), we deduce that the only possiblity is H ∼ = SL 2 (9) and |V | = 2 4 ; but in this case, for any non- So, we are left with the case t = q = r = 2.In this situation, equation (1) gives 1 and hence a = b and d = 2a.By Lemma 3.12 of [28], we conclude again that V is the natural Conversely, it is easily checked that each isomorphism type of the modules described in the statement (there are two conjugacy classes both of subgroups isomorphic to SL 2 (5) in GL 4 (3) and of subgroups isomorphic to SL 2 (13) in GL 6 (3)) satisfies the condition N q .
Remark 3.11.We observe that if H = PSL 2 (t a ) and V is an F r [H]-module such that (H, V ) satisfies the condition N q , then, seeing V in a natural way as a module for K = SL 2 (t a ) (with Z(K) in the kernel of the action), (K, V ) satisfies N q too.In fact, |K : contains a Sylow q-subgroup of K as a normal subgroup, for every non-trivial v ∈ V .We hence conclude that Lemma 3.10 describes also all possible module actions of PSL 2 (t a ) that satisfy the condition N q , for any prime q.Lemma 3.12.Let K be a quasi-simple group and let V be a finite and faithful K-module such that, for a prime q, (K, V ) satisfies the condition N q .Then K/Z(K) ∼ = J 1 , M 11 , PSL 3 (4).Moreover, if K/Z(K) ∼ = Sz(2 a ), then q = 2.
Proof.Write |V | = r d , where r is a prime, and for a Sylow b coincides with the number n q (K) of the Sylow q-subgroups of K.Moreover, Theorem 2.5 of [7] implies that r divides |K|.A check of the r-adic representations of n q (K), for every choice of prime divisors r, q of |K|, excludes the cases Finally, working by contradiction we assume that K/Z(K) ∼ = Sz(2 a ) for an odd integer a ≥ 3 and that (K, V ) satisfies the condition N 2 .Then r = 2 by [7, Proposition 2.3(a)] and, as n 2 (K) = 2 2a + 1, we deduce that b = 2a and that d = 4a.The Schur multiplier of Sz(2 a ) is a 2-group for a = 3, and it is trivial for a ≥ 5 ([2, Theorem 1 and Theorem 2]).Hence, as the action of K on V is faithful and satisfies the condition N 2 , we conclude that in any case Z(K) = 1.By the structure of the absolutely irreducible modules for the Suzuki simple groups on fields of characteristic 2 ([26, Lemma 1]), we deduce that V is (any Galois conjugate of) the natural F 2 a [K]-module seen as F 2 [K]-module, and hence |C V (S)| = 2 a and b = a, a contradiction.
Next, an improvement of Proposition 3.2 of [1].Proposition 3.13.Let H be a non-solvable group and let V be a finite and faithful H-module.If (H, V ) satisfies the condition N q for some prime q, then the solvable radical of H is cyclic.
Proof.By Lemma 4 of [32] we know that V is an irreducible module; write |V | = r a , where r is a prime and a ≥ 2. By Proposition 3.2 of [1], we can assume that r = q.Let R be the solvable radical of H and let Q be a Sylow q-subgroup of H.
We can hence assume that |V | = q a = q 2 , 2 6 ; so, there exists a primitive prime divisor t of q a − 1 (recall also that a divides t − 1).Let T be a Sylow t-subgroup of H. Since (H, V ) satisfies the condition We also observe that t does not divide |R|.In fact, if T 0 = T ∩R = 1, then Z(T 0 ), a normal abelian subgroup of N H (T 0 ), acts irreducibly on V and hence by [25, Theorem 2.1] N H (T 0 ) is solvable, which is a contradiction as H = RN H (T 0 ) by the Frattini argument.
For every prime divisor p of the order of R, there exists a T -invariant Sylow p-subgroup P of R and by Lemma 6 of [4] we get [P We observe that C H (T ) ≤ C GLa(q) (T ) is cyclic by Lemma 3.5.
It is enough to prove that E is cyclic: in this case, in fact, T centralizes E (as Aut(E) is a 2-group and t = 2) and then by coprimality Working by contradiction, we assume that E is non-cyclic.If A is a characteristic abelian subgroup of E, then V is an irreducible AT -module (because t is a primitive prime divisor of q a − 1); moreover, the restriction of V to A is homogeneous, since otherwise it would have at least t homogeneous components, yielding the contradiction a ≥ t > a; thus, A is cyclic.As a consequence, T centralizes every characteristic abelian subgroup of E. Since [E, T ] = E, [3, 24.7] yields that E is an extraspecial 2-group and Z(E) = C E (T ).Write |E| = 2 2n+1 .By applying [25,Corollary 2.6] to an irreducible constituent of the homogeneous module V E , we see that 2 n divides the dimension a of V over F q and then 2 n + 1 ≤ a + 1 ≤ t.On the other hand, |T | divides 2 n ± 1 by [16, Satz V.17.13] and we deduce that t = 2 n + 1 = a + 1.Also, by [25,Corollary 2.6] V is an absolutely irreducible E-module.As a > 2, then n ≥ 2 and there exists a non-central involution y in E. Let Y = C H (y) and U = C V (y).We remark that q = 2, as E acts faithfully and irreducibly on V .Hence, it follows that |U | = |V | 1/2 .In fact, if φ is the Brauer character corresponding to V , then φ ∈ Irr(E), φ(1) = 2 n and φ(y) = 0. So, dim Fq (U ) = [φ y , 1 y ] = φ(1)/2 = a/2.Now, if C H (U ) contains a Sylow q-subgroup of H, that (up to conjugation) we can assume to be Q, because the condition N q implies that the centralizers in V of two distinct Sylow q-subgroups of H have trivial intersection.So, C V ( y ) = C V (Q) and, in particular, y normalizes Q because of the condition N q .As y and hence by Thompson's A × B Lemma ([3, 24.2]) we deduce that y acts trivially on V , a contradiction.Hence, q divides |H : C H (U )| and, since q = 2 and y ≤ O 2 (R) H, [7, Lemma 2.4] yields that (Y, U ) satisfies the condition N q , as well.Set Y = Y /C Y (U ).If Y is solvable then, recalling that a = 2, Proposition 9 in [4] ensures that G is a group of semilinear maps on V ; now, F(Y ) is cyclic by Lemma 6.4 and Corollary 6.6 of [25].If Y is non-solvable, then we anyway get that F(Y ) is cyclic, working by induction on |V |.Now, C E ( y ) = y × E 0 , where E 0 is an extraspecial group of order 2 2(n−1)+1 .We observe that We now derive a first set of consequences of the assumption that ∆(G) has connectivity degree 1, in the case that the group G has a non-abelian minimal normal subgroup (case that, of course, includes all almost-simple groups).Proposition 3.14.Let G be a group which has a non-abelian minimal normal subgroup M .If ∆(G) is connected and has a cut-vertex p, then the following conditions are satisfied.
), then C contains a Sylow q-subgroup Q of G. Now, if q does not belong to V(C), then Q is normal in C (thus, in G) and abelian, which yields the contradiction q ∈ V(G).This proves (a).
Next, we show that for every choice of q ∈ π(G/C) and r ∈ V(C), the vertices q and r are adjacent in ∆(G).Observe in fact that, in view of [7, Proposition 2.10(b)], for every q ∈ π(G/C) there exists θ ∈ Irr(M ) such that q divides the degree of every χ ∈ Irr(G|θ).Thus, if φ ∈ Irr(C) is such that r divides φ(1), then any irreducible character of G lying over θ × φ ∈ Irr(M C) has a degree divisible by qr, as claimed.
Recalling that π(G/C) = V(G/C) contains at least three elements (as G/C has a non-abelian composition factor), we claim that the previous paragraph forces V(C) ⊆ {p}.To see this, assume that V(C) − {p} contains a prime r; let q ∈ π(G/C) − {p}, and choose two distinct primes s and u in V(G) − {p}.If one of them lies in π(G/C) and the other in V(C), then we know that s, u are adjacent in ∆(G); on the other hand, if both lie in π(G/C) or V(C), then either s − r − u or s − q − u is a path in ∆(G).This contradicts the fact that ∆(G) − p is disconnected, so V(C) ⊆ {p}.We also observe that, if V(C) = {p}, then by the previous paragraph p is a complete vertex of ∆(G).Finally, since V(C) ⊆ {p}, Proposition 3.1 yields that C has an abelian normal p-complement, and hence C ⊆ R(G).As the other inclusion is clear, we get C = R(G) and (b) is proved.
Let us now show that M is simple.Assuming the contrary, Proposition 2.10(c) of [7] yields that π(G/C) is a clique of ∆(G), against the fact that ∆(G) − p is not connected.This proves (c).
In order to prove (d) and (e), we set an almost-simple group with socle isomorphic to M , by Theorem 3.7 it follows that M ∼ = PSL 2 (t a ) for t a ≥ 4 and hence ∆(M ) is disconnected, giving us both (d) and (e).So, we may assume p ∈ π(G) and hence V(G) = π(G).If π(M ) = π(G), then ∆(M ) is a subgraph of ∆(G) with the same vertex set, so ∆(M ) is either disconnected or it is connected with cut-vertex p, hence (d) and (e) follow by part (b) of Theorem 3.4.If π(G) − π(M ) is non-empty, then Theorem 3.9 ensures that M is a simple group of Lie type (in characteristic t, say), and that every prime in π(G) − π(M ) is adjacent in ∆(G) to every other vertex different from t.In particular, ∆(G) − t is a connected graph and hence p = t.Now, if ∆(M ) is disconnected, then M ∼ = PSL 2 (t a ) for t a ≥ 4 by part (c) of Theorem 3.4.If ∆(M ) is connected, then necessarily p ∈ π(M ) and p is the only vertex adjacent to t in ∆(G).It follows that ∆(M ) is connected with cut-vertex p, and hence by part (b) of Theorem 3.4 M is isomorphic to one of the simple groups in the list L. The proof of (d) and (e) is now complete.
Next, we state a result that is going to be of fundamental importance for the rest of our work.Theorem 3.15.Let G be a non-solvable group such that ∆(G) is connected and it has a cut-vertex p.Then, setting R = R(G), we have that G/R is an almost-simple group such that V(G) = π(G/R) ∪ {p}.Furthermore, the socle X/R of G/R is such that ∆(X/R) is either disconnected or connected with cut-vertex p, and X/R is isomorphic to one of the simple groups in the list L of Proposition 3.14.
Proof.We will prove that if G is a non-solvable group such that ∆(G) is either disconnected or connected with cut-vertex p, then G/R is an almost-simple group with socle X/R ∈ L such that ∆(X/R) is either disconnected or connected with cut-vertex p, and that either V(G) = π(G/R) or V(G) = π(G/R) ∪ {p} (respectively).Assuming that the statement is false, let G be a counterexample having minimal order.We observe that, by Theorem 3.7 and Remark 3.8, ∆(G) is connected and we denote by p a cut-vertex of ∆(G).By Proposition 3.14, we see that G does not have any non-abelian minimal normal subgroup.We remark that the choice of G implies that, for every solvable normal subgroup N of G, the set V(G) is strictly larger than V(G/N ) ∪ {p}.In fact, assuming the contrary, as ∆(G/N ) is a subgraph of ∆(G), we get that ∆(G/N ) is either disconnected or connected with cut-vertex p. Now, by the minimality of G we have that G/R ∼ = (G/N )/(R/N ) is an almost-simple group whose socle X/R ∈ L is such that ∆(X/R) is either disconnected or connected with cut-vertex p, and V(G/N ) ∪ {p} ⊆ V(G/R) ∪ {p}; so, G would not be a counterexample.
Moreover, we claim that the generalized Fitting subgroup F * (G) of G and the Fitting subgroup F(G) of G coincide.In fact, let E(G) denote the subgroup generated by all the components of G.
Arguing by contradiction, assume E(G) = 1: as G does not have any non-abelian minimal normal subgroups, we have Z = Z(E(G)) = 1.Now, as observed in the previous paragraph, there exists a prime , and so Z is central in QZ.Therefore Q is normal in G, and now we must have Q ∩ Z = 1, as otherwise Q ∼ = QZ/Z would be an abelian normal Sylow q-subgroup of G, against q ∈ V(G).The conclusion is that E(G) has a non-trivial central Sylow q-subgroup, a contradiction.
Next we claim that the Frattini subgroup Φ(G) of G is trivial.Assume the contrary, and consider a minimal normal subgroup M of G such that M ≤ Φ(G).If q ∈ V(G) − V(G/M ), then G/M has an abelian normal Sylow q-subgroup, but the fact that F(G/M ) = F(G)/M yields that G has a normal Sylow q-subgroup Q as well.Since Q cannot be abelian, then Q ∩ M = 1, so M ⊆ Q; in fact we have M = Q ′ , and we see that q is uniquely determined by M .In other words, V(G) − V(G/M ) = {q} and, as observed in the first paragraph, q = p.Now, by our assumptions, the graph ∆(G) − p is disconnected, and we denote by π the connected component of q in this subgraph.Let L be a qcomplement of G, and consider any non-principal λ ∈ Irr(M ).By Theorem 13.31 of [17], and by the fact that M ⊆ Z(Q), there exists ψ ∈ Irr(Q|λ) such that the inertia subgroup I L (ψ) coincides with I L (λ); moreover, by coprimality, ψ has an extension to I G (ψ) = QI L (ψ) = QI L (λ).Note that, clearly, ψ(1) is divisible by q.Now, let t ∈ V(G) − π, t = p.In particular, q and t are not adjacent in ∆(G) and hence Gallagher's theorem and Clifford correspondence yield that I L (λ) contains a Sylow t-subgroup of L as a normal subgroup (and this Sylow subgroup is also abelian).On one hand, this implies that C L (M ) (which is contained in I L (λ)) has an abelian normal Sylow t-subgroup.On the other hand, [7, Theorem 2.5] ensures that L/C L (M ) is a group of semilinear maps on M , so it is solvable.Hence, L, and therefore G = QL, is t-solvable.We conclude that the connected component π of ∆(G) − p contains all the prime divisors of any non-solvable chief factor of G.In particular, it contains a prime different from q and this implies that ∆(G/M ) is either disconnected or connected with cut-vertex p.By the minimality of G, and since R(G/M ) = R/M , we have that by Theorem 3.9 we see that if σ = ∅, then X/R is a simple group of Lie type of characteristic (say) r and that all primes in σ are adjacent to every prime in π(X/R), except possibly to r, in ∆(G/R) and hence in ∆(G).Since, as observed above, every prime divisor of |X/R| lies in π, we deduce that V(G/R) is contained in the connected component π of q in ∆(G) − p and hence, recalling that V(G) , the factor group G/F embeds in the direct product of the G/C G (M i ), and we deduce that there exists a minimal normal subgroup M of G such that G/C G (M ) is non-solvable.Since M is abelian and As QM/M is an abelian normal subgroup of G/M , we observe that q does not divide |M |, as otherwise G and it follows that [M, Q] = M .Denoting by M the dual group of M , we then get [ M , Q] = M : in particular, q divides |H : I H (µ)| for every non-trivial µ ∈ M .Let s ∈ V(G) be a prime that is not adjacent to q in ∆(G) (recall that, q being different from p, such an s certainly exists).Then, as µ extends to I G (µ) = M I H (µ), Gallagher's theorem and Clifford correspondence imply that I H (µ) contains a Sylow s-subgroup of H as a normal subgroup, and this Sylow s-subgroup is also abelian, for every non-trivial µ ∈ M .Note that s divides |H|, since otherwise a Sylow s-subgroup of H would be contained in C H (M ), and it would easily follow that G has an abelian normal Sylow s-subgroup, against the fact that s ∈ V(G).
Let π be the connected component of ∆(G) − p that contains q.Since by assumption ∆(G) − p is disconnected, the set δ = V(G)− (π ∪{p}) is non-empty.By the previous paragraph, π 0 ⊆ π and (H, M ) satisfies N s for every s ∈ δ.As δ = ∅, Proposition 3.13 yields that the solvable radical Y of H is cyclic.Let X/Y be a minimal normal subgroup of H/Y ; then X/Y ∼ = S k , where S is a non-abelian simple group.If π(S) − {p} ⊆ δ, then (since H has abelian Hall δ-subgroups) S has an abelian p-complement, so there exists a non-trivial element x of S such that |S : C S (x)| is a power of the prime p, and this is not possible by Burnside's theorem ([17, Theorem 3.9]).So, the connected component π of ∆(G) − p intersects non-trivially π(S) and, since π(S) ⊆ V(G/M ), it follows that ∆(G/M ) is either disconnected or connected with cut-vertex p.By the minimality of G, we have that H ∼ = G/M has a unique nonsolvable composition factor S ∈ L, and that ∆(S) is either disconnected or connected with cut-vertex p.Hence, X/Y ∼ = S; observe also that ∆(S) is a subgraph of ∆(G).As Y is cyclic, Y ≤ Z(X) and then K = X ′ is a quasi-simple group ([3, (31.1)]).Now, if q divides |K|, then (K being perfect) it divides |K/Z(K)| as well, hence it divides |S| and it is therefore a vertex of ∆(G/M ), not our case.Thus, recalling that Q is a normal subgroup of H, we deduce that Q centralizes K H; moreover, we have that (K, M ) satisfies N s for every s ∈ δ ∩ π(S).But we know that S lies in L, whence Lemma 3.12 yields that either S ∼ = PSL 2 (t a ) or S ∼ = Sz(2 a ).
In the former case, we get either K = S or K ∼ = SL 2 (t a ).Recall that (K, M ) satisfies N s for every s ∈ δ: so, by Lemma 3.  6 , then we see K ∼ = SL 2 (13) as a subgroup of L = GL 6 (3); one computes that C L (K) = Z(L), of order 2, and this is again impossible as Q ≤ C L (K).
On the other hand, if S ∼ = Sz(2 a ), then by the structure of the degree graph of the Suzuki groups and the fact that ∆(S) is connected with cut-vertex p, we deduce that 2 a − 1 = p and that δ ∩ π(S) is either {2} or π(2 2a + 1).The first possibility is ruled out by Lemma 3.12 and the second one is excluded because S does not have abelian π(2 2a + 1)-Hall subgroups.This is the final contradiction that completes the proof.

The main result
We are now ready to prove the main result of this paper.Theorem 4.1.Let G be a non-solvable group with no composition factors isomorphic to PSL 2 (t a ) (t prime, t a ≥ 4), let R and K be, respectively, the solvable radical and the solvable residual of G, and let p be a prime number.Then the graph ∆(G) is connected and has cut-vertex p if and only if one of the following holds.
Moreover, p is the unique cut-vertex of ∆(G) and ∆(G) − p has two complete connected components.In all cases except case (d), one of the connected components of ∆(G) − p has size 1 and, except case (d) when R is abelian, p is a complete vertex of ∆(G).
Proof.By Theorem 3.15 we know that G/R is an almost-simple group with socle X/R and, as X/R ∼ = PSL 2 (t a ) by our assumptions, X/R is isomorphic to a simple group in the following list: Moreover, since the degree graphs of the groups in L 0 are connected (see Theorem 3.4), by Theorem 3.15 we also have that p is a cut-vertex of ∆(X/R).
We observe that KR = X, because KR certainly contains X, and X contains KR, as K/K ∩ X ∼ = KX/X is solvable, thus X ⊇ K. Now, setting L = K ∩ R, we see that K/L ∼ = X/R.We will first show that L = 1: working by contradiction, we assume that L = 1.Let L/L 0 be a chief factor of K (possibly L 0 = 1) and consider a non-principal character λ ∈ Irr(L/L 0 ).If λ is K-invariant, then ker(λ)/L 0 is a proper K-invariant subgroup of L/L 0 .Hence, ker(λ) = L 0 and λ is a faithful and Kinvariant linear character of L/L 0 .It follows that L/L 0 is cyclic and L/L 0 ≤ Z(K/L 0 ).Since K/L 0 is a perfect group, by Theorem 11.19 of [17] it follows that L/L 0 is isomorphic to a subgroup of the Schur multiplier M(K/L).In particular, we deduce that no non-principal λ ∈ Irr(L/L 0 ) can be K-invariant if M(K/L) = 1.We will now derive a contradiction, by separately considering the various possibilities for the simple group K/L.K/L ∼ = Sz(q) (where q = 2 a and a ≥ 3 an odd integer).
By Lemma 3.3 and Theorem 3.4, we know that 2 a − 1 = p and that 2 is only adjacent to p in ∆(K/L).Let λ ∈ Irr(L/L 0 ).Assuming that λ is K-invariant, since the Schur multiplier of Sz(2 a ) is trivial for a ≥ 5 ([2, Theorem 1]), then a = 3, p = 7 and M(K/L) Theorem 2]).As one can check in [5], a perfect central extension of Sz( 8) by a subgroup of order 2 has irreducible characters of degree 40, and this is a contradiction.Therefore, I K (λ)/L is a proper subgroup of K/L, and hence it is contained in a maximal subgroup, of K/L.We recall that the maximal subgroups of Sz(q) are isomorphic to one of the following groups (see, for instance, [31,Theorem 4.1]).
(a) Frobenius groups Q ⋊ C q−1 where Q ∈ Syl 2 (Sz(q)); (b) Suzuki simple groups Sz(q 0 ), where q = q r 0 , r is a prime and q 0 ≥ 8; (c) Dihedral groups D 2(q−1) ; Since 2 is only adjacent to p in ∆(K/L), by Clifford correspondence the index |K : I K (λ)| must be either odd or coprime to q 2 + 1, and hence the unique possibility for I K (λ)/L is to be contained in a Frobenius group Q ⋊ C q−1 (case (a) above) and that I K (λ)/L contains a Sylow 2-subgroup Q of K/L.This is true for every non-trivial λ in the dual group V of L/L 0 , and hence (K/L, V ) verifies the condition N 2 ; but this is impossible by Lemma 3.12.
K/L ∼ = PSL 3 (4).Recall that ∆(K/L), which is a subgraph of ∆(G), is a connected graph whose vertex set is {2, 3, 5, 7} and it has cut-vertex 5 (See Figure 1); moreover, in ∆(K/L), the vertex 5 is the only neighbour of 2. Since we have V(G) = π(K/L) ∪ {p} by Theorem 3.15, the disconnectedness of ∆(G) − p forces p = 5.Hence, 2 is adjacent only to 5 in ∆(G) as well.Assume first that there exists a non-principal λ ∈ Irr(L/L 0 ) which is K-invariant.As the Schur multiplier of PSL 3 is isomorphic to C 4 × C 4 × C 3 ([5]), by the above discussion we deduce that L/L 0 is a cyclic central subgroup of K/L 0 , and that |L/L 0 | is either 2 or 3.One can check in [5] that in the first case K/L 0 has an irreducible character of degree 28, while in the second case K/L 0 has an irreducible character of degree 84, giving a contradiction in both cases.So we may assume that I K (λ) < K, and hence I K (λ)/L is contained in a maximal subgroup H/L of K/L.The maximal subgroups of PSL 3 (4) are isomorphic to (C 2 ) 4 ⋊ A 5 , A 6 , PSL 3 (2), and (C 3 ) 2 ⋊ Q 8 ([5]) and, since 2 is only adjacent to 5 in ∆(G), it follows that H/L is isomorphic to (C 2 ) 4 ⋊ A 5 .Moreover, I K (λ)/L is forced to contain a Sylow 2-subgroup of K/L: in other words, the action of K/L on the dual group of L/L 0 satisfies condition N 2 .However, this is impossible by Lemma 3.12, and the desired conclusion is achieved in this case.
By Theorem 3.15 and the structure of ∆(M 11 ) (see Figure 1), we know that p = 5 is a cut-vertex of both ∆(G) and ∆(K/L), that V(G) = {2, 3, 5, 11} and that 3 is adjacent only to 5 in ∆(G).As K/L ∼ = M 11 has trivial Schur multiplier ( [5]), then K/L acts faithfully and irreducibly on the dual group V of L/L 0 and, since K/L cannot have any regular orbit on V (as otherwise ∆(G) would be a complete graph) by [18,Theorem 2.3] and [12,Theorem 1.1] we deduce that V is either a 10-dimensional F q [K/L]module, with q ∈ {2, 3}, or V is a 5-dimensional F 3 [K/L]-module.In the first case, one computes (via GAP [13]) that there is a K/L-orbit in V whose length is divisible by all the prime divisors of K/L, so by Clifford theory ∆(G) is a complete graph, a contradiction.On the other hand, there are two isomorphism types of 5-dimensional irreducible F 3 [K/L]-modules.One of them has a K/L-orbit of size 132 = 2 2 • 3 • 11, so by Clifford theory 3 and 11 would be adjacent in ∆(G), a contradiction.The second one, which we keep denoting as V , has non-trivial orbit sizes 22 and 220, is self-dual and the second cohomology group H 2 (K/L, V ) is trivial.One checks again via GAP [13] that the semidirect product H = V ⋊ K/L has an irreducible character of degree 660 = 2 2 • 3 • 5 • 11 and, since H is isomorphic to a normal section of G, it follows that ∆(G) is a complete graph, a contradiction.
By Theorem 3.15 and the structure of ∆(J 1 ) (see Figure 1), we know that p = 2 is a cut-vertex of both ∆(G) and ∆(K/L), and that V(G) = π(K/L) = {2, 3, 5, 7, 11, 19}.As K/L ∼ = J 1 has trivial Schur multiplier ( [5]), then K/L acts faithfully and irreducibly on the dual group V of L/L 0 .Again Theorem 2.3 of [18] and Theorem 1.1 of [12] ensure that either K/L has a regular orbit on V or V is the 20-dimensional F 2 [K/L]-module.One checks via GAP [13] that in the last case there is a Hence, in any case, by Clifford theory ∆(G) is a complete graph, a contradiction.
Our conclusion so far is that L = 1, and hence that K is a minimal normal subgroup of G.We will conclude the proof of the claims (a)-(d) by again considering separately the possibilities for K ∈ L 0 .By Theorem 3.4 ∆(K) is connected and, by Theorem 3.15, p is a cut-vertex of both ∆(G) and ∆(K).Let C = C G (K).As R ∩ K = 1, we have R ≤ C and, since G/R is almost simple, we deduce that R = C.
If K ∼ = Sz(2 a ) where a = 1 is an odd positive integer then, by Lemma 3.3, we know that the vertex 2 is only adjacent in ∆(K) to the prime divisors of 2 a − 1.It follows that 2 a − 1 is a power of the prime p, so 2 a − 1 = p is a Mersenne prime by Proposition 3.1 of [25], and hence a is a prime number.Let θ be the Steinberg character of the socle X/R ∼ = K of G/R; so θ(1) is a power of 2 and θ has an extension ψ to G/R.Seeing ψ as an irreducible character of G by inflation, then ψ is an extension of the character θ 0 ∈ Irr(K) that corresponds to θ in the natural isomorphism between X/R and K.By Gallagher's theorem we get Irr(G | θ 0 ) = {ψγ | γ ∈ Irr(G/K)}, and hence 2 is adjacent in ∆(G) to every prime in V(G/K); this forces V(G/K) ⊆ {p} and (a) is proved.
If K ∼ = M 11 or K ∼ = J 1 , then G = K × R because the outer automorphism group of K is trivial.Hence, ∆(G) = ∆(K) * ∆(R) is the join of the degree graphs of K and R and, since G has cut-vertex p, recalling the graphs of M 11 and J 1 (see Figure 1) it follows that V(R) ⊆ {p}.If K ∼ = M 11 , then p = 5 is a complete vertex of ∆(G) = ∆(K).If K ∼ = J 1 , then p = 2 and either ∆(G) = ∆(K), or ∆(G) is obtained from ∆(K) by adding an edge between 2 and 11.So, also (c) and (d) are proved and the proof of the 'only if' part of the statement is complete.
Conversely, assume that one of the conditions (a), (b), (c) or (d) holds.Since K is a non-abelian simple group and G/K is solvable, C G (K) (which is isomorphic to a subgroup of G/K) is solvable as well and hence, as the solvable radical R of G is contained in C G (K), we see that R = C G (K). Morevoer, G/KR is isomorphic to a subgroup of the outer automorphism group of K.
Assume first (a), so K ∼ = Sz(2 a ) where p = 2 a − 1 is a prime, a ≥ 3 is a prime and V(G/K) ⊆ {p}.The outer automorphism group of a Suzuki simple group consists only of field automorphisms ( [5]), so G/KR is either trivial or of order a. Recalling that p is a complete vertex of ∆(K), if G = K × R then ∆(G) = ∆(K) and p is both a complete vertex and the unique cut-vertex of ∆(G).So, we can assume that |G/KR| = a, and by Theorem 1.1 of [14] we have that a is adjacent in ∆(G/R) and hence in ∆(G) to every other vertex in π(K) − {2} (by the way, one can easily check that a ∈ π(K) only when a = 5).Hence, ∆(G) − 2 is a complete graph.If χ ∈ Irr(G) has even order, then χ lies above the Steinberg character θ of K, because a is odd and V(R) ⊆ V(G/K) ⊆ {p}.Since, by the same argument used above, θ is G-invariant and extends to G, by Gallagher's theorem χ(1) = θ(1)β(1) for some β ∈ Irr(G/K).Hence, 2 is adjacent only to p in ∆(G), and therefore p is a cut-vertex of ∆(G).Moreover, also in this case p is a complete vertex of ∆(G).
Assume now (b), so and 5 is a complete vertex of ∆(K), thus we are done.So, we can assume |G : KR| = 3.If χ ∈ Irr(G) has even degree, then as in the previous paragraph we deduce that χ lies over the Steinberg character θ of K and that χ(1) = θ(1)β(1) for some β ∈ Irr(G/K).Therefore 2 is only adjacent to 5 in ∆(G), and hence again ∆(G) = ∆(K).So, 5 is a both a complete vertex and the only cut-vertex of ∆(G).
If we have (d), so K ∼ = J 1 , G = K × R and V(R) ⊆ {2}, then either ∆(G) = ∆(K) or ∆(G) is obtained from ∆(K) by adding the edge {2, 11} (so 2 is a complete vertex of ∆(G) in this case).It follows that 2 is the only cut-vertex of ∆(G), and it is a complete vertex if and only if R is non-abelian.
Finally, the degree graphs of the relevant groups are displayed in Table 1 (cases (a-d)), and all the remaining assertions of the statement follow at once.

A proof of Theorem C
In this concluding section we prove Theorem C, that gives a characterization of the non-solvable groups whose degree graph is disconnected and has a cut-vertex.
We recall first some features of the degree graphs of the almost-simple groups with socle isomorphic to PSL 2 (t a ).Lemma 5.1.Let G be an almost-simple group with socle S ∼ = PSL 2 (t a ), where t is a prime and t a ≥ 4.
(a) If q is a prime divisor of |G/S|, then q is adjacent in ∆(G) to every prime in π(S) − {t}.(b) Assume t a > 5.If t divides |G : S| then ∆(G) is connected, while if t does not divide |G : S|, then t is an isolated vertex of ∆(G).
Proof of Theorem C. Let us first assume that ∆(G) is a disconnected graph and that it has a cut-vertex p.We recall that, by the main theorem of [24], ∆(G) has at most three connected components.If ∆(G) has three connected components then, by Theorem 3.7, G = SL 2 (2 a ) × A, where A is an abelian group and a is an integer larger than 1.In this situation, the three connected components of ∆(G) are complete graphs with vertex sets {2}, π(2 a + 1) and π(2 a − 1), and this is against the existence of a cut-vertex in ∆(G).Thus, we deduce that ∆(G) has two connected components.By Theorem 3.7, G/K is an abelian group and there is a normal subgroup N ≤ K of G such that K/N ∼ = PSL 2 (t a ) with t a ≥ 4; by Remark 3.8, V(G) = π(G/R).Moreover, if N > 1, then either K ∼ = SL 2 (t a ) or there exists a minimal normal subgroup L of G, L ≤ N , such that K/L ∼ = SL 2 (t a ) and L is isomorphic to the natural module for K/L.In the last case, as the natural module for SL 2 (t a ) is self-dual, the stabilizer of any non-trivial irreducible character of L is a Sylow t-subgroup of K, and hence Clifford theory and Lemma 5. the assumption that p is a cut-vertex of ∆(G) yields that |G : KR| is necessarily a power of p and that p = 2.Moreover, again by the assumption that p = 2 is a cut-vertex of ∆(G), none of t a + 1 and t a − 1 can be a power of 2, and hence by [25, Proposition 3.1] t a = 9 and t a is neither a Fermat nor a Mersenne prime.(In particular, t a = 5.)If t = 2 and t a = 4, then Lemma 3.2 implies that G = KR and, together with Lemma 5.1, that |G : KR| = 1 is a power of p = 2. Finally, if t a = 4, then K is isomorphic to SL 2 (4) and V(G) = π(G/R) = {2, 3, 5} and, since ∆(G) is disconnected, ∆(G) cannot have any cut-vertex.
Conversely, we assume that either K ∼ = PSL 2 (t a ) or K ∼ = SL 2 (t a ) (where t is a prime and t a ≥ 4), G/K is abelian, |G : KR| = p b (with b ≥ 0), and that either (a) or (b) holds.Suppose first that t = 2. Let χ be an irreducible character of G such that χ(1) is even and let ψ be an irreducible constituent of χ K×R .Then ψ = α × β, where α ∈ Irr(K) and β ∈ Irr(R); note that ψ(1) is even as |G : KR| is odd.Since R (which is isomorphic to a subgroup of G/K) is abelian, we see that α(1) is even and hence α is the Steinberg character of K; in particular, α is G-invariant and α(1) = 2 a .As G/K is abelian, also β is G-invariant and hence ψ is G-invariant.Now, G/KR is cyclic because it is isomorphic to a subgroup of the outer automorphism group of K; hence, by Corollary 11.22 of [17], ψ extends to G and, by Gallagher's theorem, χ(1) is a power of 2. We deduce that 2 is an isolated vertex of ∆(G) and, in particular, ∆(G) is disconnected.Moreover, by part (a) of Lemma 5.1 the vertex p is adjacent in ∆(G) to all the vertices in V(G) − {2, p}, so p is a cut-vertex of ∆(G).
Finally, we assume that t is odd.We observe that, by the same argument we used above, R/N = C G/N (K/N ); hence, by Theorem 3.7, ∆(G) is disconnected.Moreover, by Lemma 3.2 and the fact that ∆(K) is a subgraph of ∆(G), p = 2 is adjacent in ∆(G) to all vertices of V(G) − {2, t}.Let us now assume, working by contradiction, that there is a character χ ∈ Irr(G) such that qs divides χ(1) for some odd primes q ∈ π(t a − 1) and s ∈ π(t a + 1).Let θ ∈ Irr(KR) be an irreducible constituent of χ KR .Since |G : M | is power of 2, then qs necessarily divides θ(1).Observe that N , being a cyclic group of order at most 2, is central in G and hence KR = KD × H, where D ∈ Syl 2 (R) and H is the abelian 2-complement of R. It follows that qs divides the degree of any irreducible constituent α of θ K , and this is a contradiction by Lemma 3.2.Hence, no vertex of π(t a + 1) − {2} is adjacent to any vertex of π(t a + 1) − {2} and we conclude that ∆(G) = ∆(K).Finally, by (a) both π(t a − 1) − {2} and π(t a + 1) − {2} are non-empty sets of vertices of ∆(G) and hence 2 is a cut-vertex of ∆(G).The proof is complete.

Theorem 3 . 7 (
[22, Theorem 4.1 and Theorem 6.3]).Let G be a non-solvable group.Then: (I): ∆(G) has two connected components if and only if there exist normal subgroups N ⊆ K of G such that, setting C/N = C G/N (K/N ), the following conditions hold.(a) K/N ∼ = PSL 2 (t a ), where t is a prime with t a ≥ 4. (b) G/K is abelian.(c) If t a = 4, then t does not divide |G/CK|.(d) If N = 1, then either K ∼ = SL 2 (t a ) or there exists a minimal normal subgroup L of G such that K/L ∼ = SL 2 (t a ) and L is isomorphic to the natural module for K/L.(e) If t = 2 or t a = 5, then either CK = G or N = 1.(f) If t = 2 and K is an in (d) in the case K ∼ = SL 2 (t a ), then every non-principal character in Irr(L) extends to its inertia subgroup in G. (II): ∆(G) has three connected components if and only if G ∼ = SL 2 (2 a ) × A, where a ≥ 2 and A is an abelian group.
where Q varies in the set of the Sylow 2-subgroups of H. Hence, writing |V | = 2 d , |C V (Q)| = 2 b and denoting by n 2 (H) the number of Sylow 2-subgroups of H, we have (1) 10 and Remark 3.11, as M is a faithful K-module, either (s = t and) | M | = t 2a , or (s = 3 and) | M | = 3 4 with K ∼ = SL 2 (5), or finally (s = 3 and) | M | = 3 6 with K ∼ = SL 2 (13).If | M | = t 2a , then we can see H as a subgroup of GL 2a (t) and, by Lemma 3.6, |C H (K)| divides |K|.Since Q ≤ C H (K) has order coprime to |K|, we get a contradiction as 1 yield that ∆(G) − t is a complete graph, which is again impossible by the assumption of the existence of a cut-vertex in ∆(G).Hence, either N = 1 andK ∼ = PSL 2 (t a ) or |N | = 2 and K ∼ = SL 2 (t a ).Let now C be a subgroup of G such that C/N = C G/N (K/N ).Clearly, R ⊆ C; more precisely, R ⊆ C G (K), because [K, R] ⊆ N , so [K, R, K] = 1 = [R, K, K]and hence, recalling that K is a perfect group, by the Three Subgroups lemma, [K, R] = [K, K, R] = 1.Conversely, as K/N is the only non-solvable composition factor of G, C is a solvable normal subgroup of G, so C ⊆ R and hence C = R.Therefore, Theorem 3.7 yields that if t a > 5, then t does not divide |G : KR|.If t = 2, then by Lemma 3.2 and Lemma 5.1