About noncommuting graphs

The noncommuting graph ?(G) of a nonabelian finite group G is defined as follows: The vertices of ?(G) are represented by the noncentral elements of G, and two distinct vertices x and y are joined by an edge if xy ≠ yx. In [1], the following was conjectured: Let G and H be two nonabelian finite groups such that ?(G) ? ?(H); then ¦G¦ = ¦H¦. Here we give some counterexamples to this conjecture.     

On the independence number of the power graph of a finite group

The power graph ${\Gamma }_G$ of a finite group $G$ is the graph whose vertex set is $G$, two distinct elements being adjacent if one is a power of the other. In this paper, we give sharp lower and upper bounds for the independence number of ${\Gamma }_G$ and characterize the groups achieving the bounds. Moreover, we determine the independence number of ${\Gamma }_G$ if $G$ is cyclic, dihedral or generalized quaternion. Finally, we classify all finite groups $G$ whose power graphs have independence number 3 or $n?2$, where $n$ is the order of $G$.     

New characterization of <Emphasis Type="Italic">S</Emphasis><Subscript>4</Subscript>(<Emphasis Type="Italic">q</Emphasis>) by its noncommuting graph

Let G be a nonabelian group, and associate the noncommuting graph ?(G) with G as follows: the vertex set of ?(G) is G\Z(G) with two vertices x and y joined by an edge whenever the commutator of x and y is not the identity. Let S ₄(q) be the projective symplectic simple group, where q is a prime power. We prove that if G is a group with ?(G) ? ?(S ₄(q)) then G ? S ₄(q).     

On the power graph and the reduced power graph of a finite group

In this paper, for a finite group, we investigate to what extent its directed (resp. undirected) reduced power graph determines its directed power graph (resp. reduced power graph). Moreover, we investigate the determination of the orders of the elements of a finite group from its directed (resp. undirected) reduced power graph. Consequently, we show that some classes of finite groups are recognizable from their undirected reduced power graphs. Also, we study the relationship between the isomorphism classes of groups corresponding to the equivalence relations induced by the isomorphism of each of these graphs on the set of all finite groups.     

群与图的对称性

首先对平面图形的对称进行分析和利用其对称群进行量化,进而将此推广到考察一般图的广义"对称性"与图自同构群的关系,最后刻画了无平方因子阶局部本原弧传递图的自同构群结构.     

On the action of a group on a graph, II

This paper is a continuation of the survey by the author (V.I. Trofimov, On the action of a group on a graph, Acta Appl. Math. 29 (1992) 161–170) on some results concerning groups of automorphisms of locally finite vertex-symmetric graphs.     

On recognition of finite simple groups with connected prime graph

The spectrum of a finite group is the set of its element orders. We prove a theorem on the structure of a finite group whose spectrum is equal to the spectrum of a finite nonabelian simple group. The theorem can be applied to solving the problem of recognizability of finite simple groups by spectrum.     

A new characterization of L 2(q) by its noncommuting graph

Let G be a non-abelian group and associate a non-commuting graph ∇(G) with G as follows: the vertex set of ∇(G) is G\Z(G) with two vertices x and y joined by an edge whenever the commutator of x and y is not the identity. In this short paper we prove that if G is a finite group with ∇(G) ≅ ∇(M), where M = L ₂(q) (q = p ⁿ , p is a prime), then G ≅ M.      

On the intersection graph of a finite group

For a finite group G, the intersection graph of G which is denoted by Γ(G) is an undirected graph such that its vertices are all nontrivial proper subgroups of G and two distinct vertices H and K are adjacent when H ∩ K ≠ 1. In this paper we classify all finite groups whose intersection graphs are regular. Also, we find some results on the intersection graphs of simple groups and finally we study the structure of Aut(Γ(G)).     

The fundamental group of a locally finite graph with ends

We characterize the fundamental group of a locally finite graph G with ends combinatorially, as a group of infinite words. Our characterization gives rise to a canonical embedding of this group in the inverse limit of the free groups π₁(G^′) with G^′⊆G finite.     

Recognition of finite groups by the prime graph

We obtain the first example of an infinite series of finite simple groups that are uniquely determined by their prime graph in the class of all finite groups. We also show that there exist almost simple groups for which the number of finite groups with the same prime graph is equal to 2. Supported by RFBR grant No. 05-01-00797, and by SB RAS Young Researchers Support grant No. 29 and Integration project No. 2006.1.2. __________ Translated from Algebra i Logika, Vol. 45, No. 4, pp. 390–408, July–August, 2006.     

The Hopf graph algebra and renormalization group equations

We study the renormalization group equations implied by the Hopf graph algebra. The vertex functions are regarded as vectors in the dual space of the Hopf algebra. The renormalization group equations for these vertex functions are equivalent to those for individual Feynman integrals. The solution of the renormalization group equations can be represented in the form of an exponential of the beta function. We clearly show that the exponential of the one-loop beta function allows finding the coefficients of the leading logarithms for individual Feynman integrals. The calculation results agree with those obtained in the parquet approximation.Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 143, No. 1, pp. 22–32, April, 2005.     

Engel graph associated with a group

Let G be a non-Engel group and let L(G) be the set of all left Engel elements of G. Associate with G a graph as follows: Take G L(G) as vertices of and join two distinct vertices x and y whenever [x,_ky]≠1 and [y,_kx]≠1 for all positive integers k. We call , the Engel graph of G. In this paper we study the graph theoretical properties of .     

There is no upper bound for the diameter of the commuting graph of a finite group

We construct a family of finite 2-groups which have commuting graph of increasing diameter.     

正则图的变换图的谱

设G是一个图,类似全图的定义,可以定义G的8种变换图.如果G是正则图,那么图G的变换图的谱都可以由图G的谱计算得到.     

A class of amply regular graphs related to the subconstituents of a dual polar graph

The connected components of the induced graphs on each subconstituent of the dual polar graph of the odd dimensional orthogonal spaces over a finite field are shown to be amply regular. The connected components of the graphs on the second and third subconstituents are shown to be distance-regular by elementary methods.     

Groups with the same non-commuting graph

The non-commuting graph Γ_G of a non-abelian group G is defined as follows. The vertex set of Γ_G is G−Z(G) where Z(G) denotes the center of G and two vertices x and y are adjacent if and only if xy≠yx. It has been conjectured that if G and H are two non-abelian finite groups such that Γ_G≅Γ_H, then |G|=|H| and moreover in the case that H is a simple group this implies G≅H. In this paper, our aim is to prove the first part of the conjecture for all the finite non-abelian simple groups H. Then for certain simple groups H, we show that the graph isomorphism Γ_G≅Γ_H implies G≅H.