|
Sibirskie Èlektronnye Matematicheskie Izvestiya [Siberian Electronic Mathematical Reports], 2014, Volume 11, Pages 246–257
(Mi semr485)
|
|
|
|
This article is cited in 4 scientific papers (total in 4 papers)
Mathematical logic, algebra and number theory
On realizability of a graph as the prime graph of a finite group
A. L. Gavrilyukabc, I. V. Khramtsova, A. S. Kondrat'evab, N. V. Maslovaba a N. N. Krasovskii Institute of Mathematics and Mechanics, 16, S. Kovalevskaja St., 620990, Ekaterinburg, Russia
b Ural Federal University named after the first President of Russia B. N. Yeltsin, 19, Mira St., 620002, Ekaterinburg, Russia
c Research Center for Pure and Applied Mathematics,
Graduate School of Information Sciences, Tohoku University,
980-8579, Sendai, Japan
Abstract:
The problem of the realizability of a graph as the prime graph (the Gruenberg–Kegel graph) of a finite group is considered. This problem is completely solved for graphs with at most five vertices.
Keywords:
finite group, prime graph (Gruenberg–Kegel graph), realizability of a graph.
Received November 14, 2013, published March 26, 2014
Citation:
A. L. Gavrilyuk, I. V. Khramtsov, A. S. Kondrat'ev, N. V. Maslova, “On realizability of a graph as the prime graph of a finite group”, Sib. Èlektron. Mat. Izv., 11 (2014), 246–257
Linking options:
https://www.mathnet.ru/eng/semr485 https://www.mathnet.ru/eng/semr/v11/p246
|
Statistics & downloads: |
Abstract page: | 481 | Full-text PDF : | 143 | References: | 84 |
|