An Adjacency Criterion for the Prime Graph of a Finite Simple Group
Algebra and Logic · 2005-11 · 44 (6) · 381-406
DOI: 10.1007/s10469-005-0037-5 ↗Kurz gefasst
Fachartikel in der Zeitschrift Algebra and Logic, 2005-11. Verfasst von A. V. Vasiliev und 1 weiteren Autor:innen. Die Arbeit wurde bisher 129-mal zitiert (Crossref) und nennt 18 Literaturangaben.
Abstract (Originalsprache)
For every finite non-Abelian simple group, we give an exhaustive arithmetic criterion for adjacency of vertices in a prime graph of the group. For the prime graph of every finite simple group, this criterion is used to determine an independent set with a maximal number of vertices and an independent set with a maximal number of vertices containing 2, and to define orders on these sets; the information obtained is collected in tables. We consider several applications of these results to various problems in finite group theory, in particular, to the recognition-by-spectra problem for finite groups.
Zitieren
APA
Vasiliev, A. V., & Vdovin, E. P. (2005). An Adjacency Criterion for the Prime Graph of a Finite Simple Group. Algebra and Logic, 44(6), 381-406. https://doi.org/10.1007/s10469-005-0037-5
Vancouver
Vasiliev AV, Vdovin EP. An Adjacency Criterion for the Prime Graph of a Finite Simple Group. Algebra and Logic. 2005;44(6):381-406. doi:10.1007/s10469-005-0037-5
BibTeX
@article{Vasiliev2005,
author = {Vasiliev, A. V. and Vdovin, E. P.},
title = {An Adjacency Criterion for the Prime Graph of a Finite Simple Group},
journal = {Algebra and Logic},
year = {2005},
volume = {44},
number = {6},
pages = {381--406},
doi = {10.1007/s10469-005-0037-5}
}
EUVIMED