It is proved that the groups and are recognized by prime graph. As corollary, it is completed the positive solution of the Mazurov's problem that every finite group whose the prime graph has at least three connected components is either reconizable by spectrum or isomorphic to .
Translated title of the contributionRecognizability of groups and by prime graph
Original languageRussian
Pages (from-to)223-229
JournalТруды института математики и механики УрО РАН
Volume20
Issue number2
Publication statusPublished - 2014

    GRNTI

  • 27.17.00

    Level of Research Output

  • VAK List

ID: 6470149