Disconnected character graphs and odd dominating sets

DOI10.1080/00927872.2021.1894437OpenAlexW3136254261MaRDI QIDQ5153795

Mahdi Ebrahimi

Publication date: 1 October 2021

Published in: Communications in Algebra (Search for Journal in Brave)

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

zbMATH Keywords

dominating setdisconnected graphcharacter degreecharacter graph

Mathematics Subject Classification ID

Ordinary representations and characters (20C15) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

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.
• Connectedness of degree graphs of nonsolvable groups.
• Diameters of degree graphs of nonsolvable groups.
• Bounding the number of vertices in the degree graph of a finite group
• On the character degree graph of finite groups
• Solvable groups whose degree graphs have two connected components
• Character degrees of extensions of PSL2(q) and SL2(q)
• On the character degree graph of solvable groups
• On the Number of Components of a Graph Related to Character Degrees
• K₄-free character graphs with seven vertices
• Nonsolvable groups with no prime dividing three character degrees.

This page was built for publication: Disconnected character graphs and odd dominating sets