Finite groups with specific number of centralizers and graphs without triangles.

MaRDI QIDQ5747303zbMATH OpenFDO

Authors Zeinab Foruzanfar, Zohreh Mostaghim

Publication date 11 February 2014

zbMATH Keywords

\(n\)-centralizer groupsconjugacy class graphsconjugacy classesFrobenius groups

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Special subgroups (Frattini, Fitting, etc.) (20D25) Arithmetic and combinatorial problems involving abstract finite groups (20D60) Subgroup theorems; subgroup growth (20E07) Conjugacy classes for groups (20E45)

Recommendations

• Finite groups with graphs containing no triangles
• On finite groups with nine centralizers
• Counting Centralizers of a Finite Group with an Application in Constructing the Commuting Conjugacy Class Graph
• Groups with specific number of centralizers.
• Finite groups determined by the number of element centralizers

Cited in

(4)

• Finite groups with graphs containing no triangles
• Finite groups whose prime graphs do not contain triangles. III
• Counting Centralizers of a Finite Group with an Application in Constructing the Commuting Conjugacy Class Graph
• Finite nonsolvable groups whose character graphs have no triangles.

This page was built for publication: Finite groups with specific number of centralizers and graphs without triangles.

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