Cargando…
A characterization of L(3)(4) by its character degree graph and order
Let G be a finite group. The character degree graph [Formula: see text] of G is the graph whose vertices are the prime divisors of character degrees of G and two vertices p and q are joined by an edge if pq divides the character degree of G. Let [Formula: see text] be the projective special linear g...
Autores principales: | Liu, Shitian, Xie, Yunxia |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer International Publishing
2016
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4771690/ https://www.ncbi.nlm.nih.gov/pubmed/27026936 http://dx.doi.org/10.1186/s40064-016-1785-5 |
Ejemplares similares
-
A characterization of some alternating groups A(p+8) of degree p + 8 by OD
por: Liu, Shitian, et al.
Publicado: (2016) -
On the Treewidths of Graphs of Bounded Degree
por: Song, Yinglei, et al.
Publicado: (2015) -
On reciprocal degree distance of graphs
por: An, Mingqiang, et al.
Publicado: (2023) -
Character theory for the odd order theorem
por: Peterfalvi, T, et al.
Publicado: (2000) -
Learning-Based Ordering Characters on Ancient Document
por: Lee, Hyeonjin, et al.
Publicado: (2022)