Groups whose prime graphs have no triangles.

DOI10.1016/J.JALGEBRA.2012.12.024MaRDI QIDQ373879zbMATH OpenOpenAlexFDO

Authors H. P. Tong-Viet

Publication date 25 October 2013

Published in Journal of Algebra (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1303.3457, http://www.sciencedirect.com/science/article/pii/S0021869313000215

zbMATH Keywords

character degree graphscharacter degreescyclesfinite groupsfinite nonsolvable groupsirreducible charactersprime graphstreestriangles

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Ordinary representations and characters (20C15) Simple groups: alternating groups and groups of Lie type (20D06) Arithmetic and combinatorial problems involving abstract finite groups (20D60)

Abstract: Let G be a finite group and let cd(G) be the set of all complex irreducible character degrees of G Let ho(G) be the set of all primes which divide some character degree of G. The prime graph Delta(G) attached to G is a graph whose vertex set is ho(G) and there is an edge between two distinct primes u and v if and only if the product uv divides some character degree of G. In this paper, we show that if G is a finite group whose prime graph Delta(G) has no triangles, then Delta(G) has at most 5 vertices. We also obtain a classification of all finite graphs with 5 vertices and having no triangles which can occur as prime graphs of some finite groups. Finally, we show that the prime graph of a finite group can never be a cycle nor a tree with at least 5 vertices.

Recommendations

• Prime graphs of finite groups with a small number of triangles.
• Finite groups with \(K_5\)-free prime graphs
• On nonsolvable groups whose prime degree graphs have four vertices and one triangle
• Finite groups whose prime graphs do not contain triangles. I
• Finite groups whose prime graphs are regular.

Cited in

(33)

• Finite groups with graphs containing no triangles
• Regular character-graphs whose eigenvalues are greater than or equal to -2
• Five-vertex degree graphs of nonsolvable groups
• An overview on the bipartite divisor graph for the set of irreducible character degrees
• Bounding the number of vertices in the degree graph of a finite group
• Recognition of \(\mathrm{PSL}(2, p^2)\) by order and some properties on character degrees
• Finite groups with K₄-free prime graphs.
• Finite groups whose prime graphs do not contain triangles. I
• Finite groups whose prime graphs do not contain triangles. III
• Finite groups whose character graphs associated with codegrees have no triangles.
• Simple groups with irreducible character degree graphs containing no triangles.
• CHARACTER GRAPHS WITH NONBIPARTITE HAMILTONIAN COMPLEMENT
• Finite groups whose prime graphs are regular.
• Prime graphs and Brauer characters
• Finite groups whose character degree graphs coincide with their prime graphs.
• Prime graphs of finite groups with a small number of triangles.
• On finite groups with small simple spectrum. II
• 1-Connected character-graphs of finite groups with non-bipartite complement
• \(n\)-exact character graphs
• Character graphs with diameter three
• On nonsolvable groups whose prime degree graphs have four vertices and one triangle
• Recognition of the simple groups \(\mathrm{PSL}_2(q)\) by character degree graph and order
• 4-regular prime graphs of nonsolvable groups
• Finite groups whose codegrees are almost prime
• Disconnected character graphs and odd dominating sets
• On regular bipartite divisor graph for the set of irreducible character degrees
• Planar character-graphs
• On the multiplicity of character degrees of nonsolvable groups
• K₄-free character graphs with seven vertices
• Finite groups with \(K_5\)-free prime graphs
• 5-regular prime graphs of finite nonsolvable groups
• On the generating graph in a finite group
• Prime divisors of irreducible character degrees.

This page was built for publication: Groups whose prime graphs have no triangles.

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