Suppose that G is a finite group, p(G) is the set of prime divisors of its order, and.(G) is the set of orders of its elements. A graph with the following adjacency relation is defined on p(G): different vertices r and s from p(G) are adjacent if and only if rs..(G). This graph is called the Gruenberg-Kegel graph or the prime graph of G and is denoted by GK(G). In A. V. Vasil'ev's Question 16.26 from the "Kourovka Notebook," it is required to describe all pairs of nonisomorphic simple nonabelian groups with identical Gruenberg-Kegel graphs. M. Hagie and M. A. Zvezdina gave such a description in the case where one of the groups coincides with a sporadic group and an alternating group, respectively. The author solved this question for finite simple groups of Lie type over fields of the same characteristic. In the present paper, we prove the following theorem. Theorem. Let G = A +/- n-1(q), where n. {3, 4, 5, 6}, and let G1 be a finite simple group of Lie type over a field of order q1 nonisomorphic to G, where q = pf, q1 = pf1 1, and p and p1 are different primes. If the graphs GK(G) and GK(G1) coincide, then one of the following statements holds: (1) {G, G1} = {A1(7), A1(8)}; (2) {G, G1} = {A3(3), 2F4(2)}; (3) {G, G1} = {2A3(3), A1(49)}; (4) {G, G1} = {A2(q), 3D4(q1)}, where (q - 1) 3 = 3, q + 1 = 2k, and q1 > 2; (5) {G, G1} = {Ae4(q), Ae1 4 (q1)}, where qq1 is odd; (6) {G, G1} = {Ae4(q), 3D4(q1)}, where (q - 1) 5 = 5 and q1 > 2; (7) G = Ae5(q) and G1. {B3(q1), C3(q1), D4(q1)}.
