On nonsolvable groups whose prime degree graphs have four vertices and one triangle

DOI10.22108/IJGT.2017.21476MaRDI QIDQ5124048zbMATH OpenOpenAlexFDO

Authors Roghayeh Hafezieh

Publication date 17 September 2020

Full work available at URL https://doaj.org/article/5e0770b322f441c892924ff9ba553b6c

zbMATH Keywords

irreducible character degreeprime degree graphtriangle

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Ordinary representations and characters (20C15)

Recommendations

• Groups whose prime graphs have no triangles.
• Four-vertex degree graphs of nonsolvable groups.
• Prime graphs of finite groups with a small number of triangles.
• Five-vertex degree graphs of nonsolvable groups
• Graphs of nonsolvable groups with four degree-vertices.

Cites work

• An overview of graphs associated with character degrees and conjugacy class sizes in finite groups.
• Four-vertex degree graphs of nonsolvable groups.
• Groups whose prime graphs have no triangles.
• scientific article; zbMATH DE number 5504628 (Why is no real title available?)
• Prime graphs of finite groups with a small number of triangles.

Cited in

(11)

• Five-vertex degree graphs of nonsolvable groups
• Finite groups with K₄-free prime graphs.
• Finite groups whose prime graphs do not contain triangles. II
• Finite groups whose prime graphs do not contain triangles. III
• Degree prime graph
• Four-vertex degree graphs of nonsolvable groups.
• Groups whose prime graphs have no triangles.
• Finite groups whose character degree graphs coincide with their prime graphs.
• Prime graphs of finite groups with a small number of triangles.
• 4-regular prime graphs of nonsolvable groups
• Graphs of nonsolvable groups with four degree-vertices.

This page was built for publication: On nonsolvable groups whose prime degree graphs have four vertices and one triangle

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