Finite groups whose character graphs associated with codegrees have no triangles.

DOI10.1142/S1005386716000031MaRDI QIDQ2796957zbMATH OpenFDO

Authors Huan Xiong

Publication date 30 March 2016

Published in Algebra Colloquium (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1508.07228

zbMATH Keywords

character codegreescharacter graphsfinite groupsirreducible characters

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Ordinary representations and characters (20C15) Arithmetic and combinatorial problems involving abstract finite groups (20D60)

Abstract: Motivated by the Problem $164$ proposed by Y. Berkovich and E. Zhmud' in their book "Characters of finite groups, Part $1$", we give a characterization of finite groups whose irreducible character codegrees are prime powers. This is based on a new kind of character graphs of finite groups associated with codegrees. Such graphs have close and obvious connections with character coedgree graphs. For example, they have the same number of connected components. By analogy with the work of finite groups whose character graphs (associated with degrees) have no triangles, we conduct a result of classifying finite groups whose character graphs associated with codegrees have no triangles in the latter part of this paper.

Recommendations

• Finite groups whose codegrees are almost prime
• Groups whose prime graphs have no triangles.
• Finite groups whose character degree graphs are empty graphs.
• Prime graphs of finite groups with a small number of triangles.
• Finite groups whose character degree graphs coincide with their prime graphs.

Cites work

• A note on character degrees of finite solvable groups
• An overview of graphs associated with character degrees and conjugacy class sizes in finite groups.
• Co-degrees of irreducible characters in finite groups.
• Finite nonsolvable groups whose character graphs have no triangles.
• Finite Solvable Groups Whose Character Degree Graphs Are Not Complete
• Finite solvable groups whose character graphs are trees.
• Normal \(p\)-complements for finite groups

Cited in

(5)

• Co-degree graphs and order elements
• Finite groups whose character degree graphs are empty graphs.
• Finite groups whose codegrees are almost prime
• Groups with few codegrees of irreducible characters
• Finite nonsolvable groups whose character graphs have no triangles.

This page was built for publication: Finite groups whose character graphs associated with codegrees have no triangles.

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