Character graphs with diameter three
From MaRDI portal
Publication:5119218
DOI10.1090/proc/15160OpenAlexW3021851910MaRDI QIDQ5119218
Publication date: 3 September 2020
Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1909.03062
Ordinary representations and characters (20C15) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Distance in graphs (05C12)
Related Items (2)
1-Connected character-graphs of finite groups with non-bipartite complement ⋮ Regular character-graphs whose eigenvalues are greater than or equal to \(-2\)
Cites Work
- Unnamed Item
- 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.
- Finite groups with small sums of degrees of some nonlinear irreducible characters
- Some simple groups which are determined by the set of their character degrees. I
- Hamiltonian character graphs
- On the character degree graph of finite groups
- Diameters of degree graphs of nonsolvable groups. II.
- On the character degree graph of solvable groups
- On the Number of Components of a Graph Related to Character Degrees
- SOLVABLE GROUPS WITH CHARACTER DEGREE GRAPHS HAVING 5 VERTICES AND DIAMETER 3
- K4-free character graphs with seven vertices
- ON THE REGULARITY OF CHARACTER DEGREE GRAPHS
- Degree Graphs of Simple Linear and Unitary Groups
- Nonsolvable groups with no prime dividing three character degrees.
This page was built for publication: Character graphs with diameter three