1-Connected character-graphs of finite groups with non-bipartite complement

DOI10.1142/S0219498821500584OpenAlexW2999332449MaRDI QIDQ4988249

Zohreh Mirzaei, Mahdi Ebrahimi, Maryam Khatami

Publication date: 12 May 2021

Published in: Journal of Algebra and Its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0219498821500584

zbMATH Keywords

cut vertexcharacter degreecharacter-graph

Mathematics Subject Classification ID

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

Related Items (2)

Non-solvable groups whose character degree graph has a cut-vertex. I ⋮ Planar character-graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Groups whose prime graphs have no triangles.
• An overview of graphs associated with character degrees and conjugacy class sizes in finite groups.
• A finite simple group of Lie type has p-blocks with different defects, \(p\neq 2\)
• Connectedness of degree graphs of nonsolvable groups.
• Some simple groups which are determined by the set of their character degrees. I
• Diameters of degree graphs of nonsolvable groups.
• Hamiltonian character graphs
• Solvable groups whose prime divisor character degree graphs are 1-connected
• On the character degree graph of finite groups
• Solvable groups whose degree graphs have two connected components
• On the character degree graph of solvable groups
• Prime divisors of character degrees
• On the Number of Components of a Graph Related to Character Degrees
• Character graphs with diameter three
• K₄-free character graphs with seven vertices
• Nonsolvable groups with no prime dividing three character degrees.

This page was built for publication: 1-Connected character-graphs of finite groups with non-bipartite complement