Finite solvable groups whose character graphs are trees.

DOI10.1016/J.JALGEBRA.2006.09.009MaRDI QIDQ876391zbMATH OpenOpenAlexFDO

Authors Yi-Tao Wu, Pu Zhang

Publication date 18 April 2007

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

Full work available at URL https://doi.org/10.1016/j.jalgebra.2006.09.009

zbMATH Keywords

character degree graphsfinite groupsirreducible complex characterssymmetric group \(S_4\)trees

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Ordinary representations and characters (20C15) Finite solvable groups, theory of formations, Schunck classes, Fitting classes, (pi)-length, ranks (20D10) Arithmetic and combinatorial problems involving abstract finite groups (20D60)

Review text

For a finite group \(G\), the character graph \(\Gamma(G)\) has the nonlinear irreducible complex characters as its vertices, and two of them are joined by an edge whenever their degrees have a common prime divisor. -- This graph has been studied quite extensively in recent years. In the paper under review it is shown that for solvable groups, \(\Gamma(G)\) has no triangles if and only if \(\Gamma(G)\) has only two vertices, or \(G\) is isomorphic to the symmetric group \(S_4\). The condition of having no triangles is also equivalent to \(\Gamma(G)\) being a tree.

Recommendations

• Finite Solvable Groups Whose Character Degree Graphs Are Not Complete
• Solvable graphs of finite groups
• Solvable groups with irreducible character degree graphs having connected components.
• On the character degree graph of solvable groups
• A characterization of the finite soluble groups
• The generating graph of finite soluble groups.
• A characterization of finite soluble groups
• A characterization of finite soluble groups
• On the Soluble Graph of a Finite Simple Group
• Finite nonsolvable groups whose character graphs have no triangles.

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.
• Derived lengths and character degrees
• Finite Groups Having Only One Irreducible Representation of Degree Greater than One
• Finite Groups in which the Degrees of the Nonlinear Irreducible Characters are Distinct
• Finite groups whose conjugacy class graphs have few vertices.
• Finite groups with graphs containing no triangles
• scientific article; zbMATH DE number 4110917 (Why is no real title available?)
• scientific article; zbMATH DE number 3762273 (Why is no real title available?)
• scientific article; zbMATH DE number 3526920 (Why is no real title available?)
• scientific article; zbMATH DE number 479556 (Why is no real title available?)
• On a Graph Related to Conjugacy Classes of Groups
• On the diameter of a graph related to p-regular conjugacy classes of finite groups
• On the Diameter of a Graph Related to Conjugacy Classes of Groups
• On the Number of Components of a Graph Related to Character Degrees

Cited in

(13)

• Finite groups with graphs containing no triangles
• Groups which do not have four irreducible characters of degrees divisible by a prime \(p\)
• The block graph of a finite group
• Finite groups whose character graphs associated with codegrees have no triangles.
• Finite groups whose character degree graphs are empty graphs.
• Coloring of character graphs
• Relative character graph using group representation
• \(n\)-exact character graphs
• FINITE SOLVABLE GROUPS WITH DISTINCT MONOMIAL CHARACTER DEGREES
• Planar character-graphs
• Solvable graphs of finite groups
• Nonsolvable groups with no prime dividing three character degrees.
• Finite nonsolvable groups whose character graphs have no triangles.

This page was built for publication: Finite solvable groups whose character graphs are trees.

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