Search

Let G be a finite group, and let cd ( G ) denote the set of degrees of the irreducible complex characters of G . This paper is a contribution to the study of the degree graph of G , that is, the prime graph built on the set cd ( G ) . Namely, we characterize finite groups whose degree graph has three independent vertices (i.e., three vertices that are pairwise non-adjacent). Our result turns out to be a generalization of several previously-known theorems concerning the structure of the degree graph. [ABSTRACT FROM AUTHOR]

Abstract: Given a finite group G, consider the prime graph built on the set of conjugacy class sizes of G. Denoting by the set of vertices of this graph that are not adjacent to at least one other vertex, we show that the Hall -subgroups of G (which do exist) are metabelian. [Copyright &y& Elsevier]

Abstract: Given a finite group , denote by the simple undirected graph whose vertices are the (distinct) non-central conjugacy class sizes of , and for which two vertices of are adjacent if and only if they are not coprime numbers. In this note we prove that is a -regular graph if and only if it is a complete graph with three vertices, and is a -regular graph if and only if it is a complete graph with four vertices. [Copyright &y& Elsevier]

Abstract: Let G be a finite group, and let denote the prime graph built on the set of conjugacy class sizes of G. In this paper, we consider the situation when has “few complete vertices”, and our aim is to investigate the influence of this property on the group structure of G. More precisely, assuming that there exists at most one vertex of that is adjacent to all the other vertices, we show that G is solvable with Fitting height at most 3 (the bound being the best possible). Moreover, if has no complete vertices, then G is a semidirect product of two abelian groups having coprime orders. Finally, we completely characterize the case when is a regular graph. [Copyright &y& Elsevier]