Disconnected character graphs and odd dominating sets
From MaRDI portal
Recommendations
- 1-Connected character-graphs of finite groups with non-bipartite complement
- On the character degree graph of finite groups
- Finite groups whose character degree graphs coincide with their prime graphs.
- CHARACTER GRAPHS WITH NONBIPARTITE HAMILTONIAN COMPLEMENT
- Disconnectedness and Diameters of Degree Graphs Associated with Normal Subgroups#
Cites work
- K₄-free character graphs with seven vertices
- An overview of graphs associated with character degrees and conjugacy class sizes in finite groups.
- Bounding the number of vertices in the degree graph of a finite group
- Character degrees of extensions of \(\mathrm{PSL}_2(q)\) and \(\mathrm{SL}_2(q)\).
- Character theory of finite groups.
- Connectedness of degree graphs of nonsolvable groups.
- Diameters of degree graphs of nonsolvable groups.
- Groups whose prime graphs have no triangles.
- scientific article; zbMATH DE number 479556 (Why is no real title available?)
- Nonsolvable groups with no prime dividing three character degrees.
- On the character degree graph of finite groups
- On the character degree graph of solvable groups
- On the Number of Components of a Graph Related to Character Degrees
- Solvable groups whose degree graphs have two connected components
This page was built for publication: Disconnected character graphs and odd dominating sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5153795)