Groups containing an element that permutes with a finite number of its conjugates

We study a group G containing an element g such that C_G(g)∩g^G is finite. The nonoriented graph Γ is defined as follows. The vertex set of Γ is the conjugacy class g^G. Vertices x and y of the graph G are bridged by an edge iff x≠y and xy=yx. Let Γ₀ be some connected component of G. On a condition that any two vertices of Γ₀ generate a nilpotent group, it is proved that a subgroup generated by the vertex set of Γ₀ is locally nilpotent. Supported by the RF State Committee of Higher Education. Translated fromAlgebra i Logika, Vol. 37, No. 6, pp. 637–650, November–December, 1998.     

On r-recognition by prime graph of Bp(3) where p is an odd prime

Let G be a finite group. The prime graph Γ(G) of G is defined as follows. The vertices of Γ(G) are the primes dividing the order of G and two distinct vertices p and p′ are joined by an edge if there is an element in G of order pp′. We denote by k(Γ(G)) the number of isomorphism classes of finite groups H satisfying Γ(G) = Γ(H). Given a natural number r, a finite group G is called r-recognizable by prime graph if k(Γ(G)) =  r. In Shen et al. (Sib. Math. J. 51(2):244–254, 2010), it is proved that if p is an odd prime, then B _p (3) is recognizable by element orders. In this paper as the main result, we show that if G is a finite group such that Γ(G) = Γ(B _p (3)), where p > 3 is an odd prime, then G @ B_p(3){G\cong B_p(3)} or C _p (3). Also if Γ(G) = Γ(B ₃(3)), then G @ B₃(3), C₃(3), D₄(3){G\cong B_3(3), C_3(3), D_4(3)}, or G/O₂(G) @ Aut(²B₂(8)){G/O_2(G)\cong {\rm Aut}(^2B_2(8))}. As a corollary, the main result of the above paper is obtained.     

Characterization of $ {\mathbb{A}_{16}} $ by a noncommuting graph

Let G be a finite non-Abelian group. We define a graph Γ _G ; called the noncommuting graph of G; with a vertex set G − Z(G) such that two vertices x and y are adjacent if and only if xy ≠ yx: Abdollahi, Akbari, and Maimani put forward the following conjecture (the AAM conjecture): If S is a finite non-Abelian simple group and G is a group such that Γ _S ≅ Γ _G ; then S ≅ G: It is still unknown if this conjecture holds for all simple finite groups with connected prime graph except \mathbbA₁₀ {\mathbb{A}_{10}} , L ₄(8), L ₄(4), and U ₄(4). In this paper, we prove that if \mathbbA₁₆ {\mathbb{A}_{16}} denotes the alternating group of degree 16; then, for any finite group G; the graph isomorphism G_\mathbbA16 @ G_G {\Gamma_{{\mathbb{A}_{16}}}} \cong {\Gamma_G} implies that \mathbbA₁₆ @ G {\mathbb{A}_{16}} \cong G .     

Metric properties of the tropical Abel–Jacobi map

Let Γ be a tropical curve (or metric graph), and fix a base point p∈Γ. We define the Jacobian group J(G) of a finite weighted graph G, and show that the Jacobian J(Γ) is canonically isomorphic to the direct limit of J(G) over all weighted graph models G for Γ. This result is useful for reducing certain questions about the Abel–Jacobi map Φ _p :Γ→J(Γ), defined by Mikhalkin and Zharkov, to purely combinatorial questions about weighted graphs. We prove that J(G) is finite if and only if the edges in each 2-connected component of G are commensurable over ℚ. As an application of our direct limit theorem, we derive some local comparison formulas between ρ and \varPhi_p^*(r){\varPhi}_{p}^{*}(\rho) for three different natural “metrics” ρ on J(Γ). One of these formulas implies that Φ _p is a tropical isometry when Γ is 2-edge-connected. Another shows that the canonical measure μ _Zh on a metric graph Γ, defined by S. Zhang, measures lengths on Φ _p (Γ) with respect to the “sup-norm” on J(Γ).     

A characterization of alternating groups. II

Let G be a group. A subset X of G is called an A-subset if X consists of elements of order 3, X is invariant in G, and every two non-commuting members of X generate a subgroup isomorphic to A₄ or to A₅. Let X be the A-subset of G. Define a non-oriented graph Γ(X) with vertex set X in which two vertices are adjacent iff they generate a subgroup isomorphic to A₄. Theorem 1 states the following. Let X be a non-empty A-subset of G. (1) Suppose that C is a connected component of Γ(X) and H = 〈C〉. If H ∩ X does not contain a pair of elements generating a subgroup isomorphic to A₅ then H contains a normal elementary Abelian 2-subgroup of index 3 and a subgroup of order 3 which coincides with its centralizer in H. In the opposite case, H is isomorphic to the alternating group A(I) for some (possibly infinite) set I, |I| ≥ 5. (2) The subgroup 〈X^G〉 is a direct product of subgroups 〈C _α〉-generated by some connected components C _α of Γ(X). Theorem 2 asserts the following. Let G be a group and X⊆G be a non-empty G-invariant set of elements of order 5 such that every two non-commuting members of X generate a subgroup isomorphic to A₅. Then 〈XG〉 is a direct product of groups each of which either is isomorphic to A₅ or is cyclic of order 5. Supported by RFBR grant No. 05-01-00797; FP “Universities of Russia,” grant No. UR.04.01.028; RF Ministry of Education Developmental Program for Scientific Potential of the Higher School of Learning, project No. 511; Council for Grants (under RF President) and State Aid of Fundamental Science Schools, project NSh-2069.2003.1. __________ Translated from Algebra i Logika, Vol. 45, No. 2, pp. 203–214, March–April, 2006.     

Commutative rings whose zero-divisor graph is a proper refinement of a star graph

A graph is called a proper refinement of a star graph if it is a refinement of a star graph, but it is neither a star graph nor a complete graph. For a refinement of a star graph G with center c, let G _c ^* be the subgraph of G induced on the vertex set V (G)\ {c or end vertices adjacent to c}. In this paper, we study the isomorphic classification of some finite commutative local rings R by investigating their zero-divisor graphs G = Γ(R), which is a proper refinement of a star graph with exactly one center c. We determine all finite commutative local rings R such that G _c ^* has at least two connected components. We prove that the diameter of the induced graph G _c ^* is two if Z(R)² ≠ {0}, Z(R)³ = {0} and G _c ^* is connected. We determine the structure of R which has two distinct nonadjacent vertices α, β ∈ Z(R)* \ {c} such that the ideal [N(α) ∩ N(β)]∪ {0} is generated by only one element of Z(R)*\{c}. We also completely determine the correspondence between commutative rings and finite complete graphs K _n with some end vertices adjacent to a single vertex of K _n .     

Quasirecognition by prime graph of F4(q) where q?=?2n?>?2

The prime graph of a finite group G is denoted by Γ(G). In this paper as the main result, we show that if G is a finite group such that Γ(G) = Γ(F ₄(q)), where q = 2 ⁿ  > 2, then G has a unique nonabelian composition factor isomorphic to F ₄(q). We also show that if G is a finite group satisfying |G| = |F ₄(q)| and Γ(G) = Γ(F ₄(q)), where q = 2 ⁿ  > 2, then G @ F₄(q){G \cong F_4(q)}. As a consequence of our result we give a new proof for a conjecture of Shi and Bi for F ₄(q) where q = 2 ⁿ  > 2.     

Deformations of complex structures on Γ/SL 2(C)

LetG be a connected complex semisimple Lie group. Let Γ be a cocompact lattice inG. In this paper, we show that whenG isSL ₂(C), nontrivial deformations of the canonical complex structure onX exist if and only if the first Betti number of the lattice Γ is non-zero. It may be remarked that for a wide class of arithmetic groups Γ, one can find a subgroup Γ′ of finite index in Γ, such that Γ′/[Γ′,Γ′] is finite (it is a conjecture of Thurston that this is true for all cocompact lattices inSL(2, C)). We also show thatG acts trivially on the coherent cohomology groupsH ⁱ(Γ/G, O) for anyi≥0.     

The spectrum of the averaging operator for a finite homogeneous graph

We give an estimate for the spectrum of the averaging operator T₁(Γ, 1) over the radius 1 for the finite (q+1)-homogeneous quotient graph Γ/X, where X is an infinite (q+1)-homogeneous tree associated with the free group G over a finite set of generators S={x₁ ..., x_p} (2p=q+1), and Γ, a subgroup of finite index in G. T₁(Γ, 1) is defined on the subspace L²(Γ/G, 1) ⊖ E_ex, where E_ex is the subspace of eigenfunctions of T₁(Γ, 1) with eigenvalue λ such that |λ|=q+1. We present a construction of some finite homogeneous graphs such that the spectrum of their adjacency matrices can be calculated explicitly. Bibliography: 11 titles. Translated fromZapiski Nauchnykh Seminarov POMI, Vol. 205, 1993, pp. 92–109. Translated by A. M. Nikitin.     

On the prime graph of <Emphasis Type="Italic">PSL</Emphasis>(2, <Emphasis Type="Italic">p</Emphasis>) where <Emphasis Type="Italic">p</Emphasis> > 3 is a prime number

Let G be a finite group. We define the prime graph Γ(G) as follows. The vertices of Γ(G) are the primes dividing the order of G and two distinct vertices p, q are joined by an edge if there is an element in G of order pq. Recently M. Hagie [5] determined finite groups G satisfying Γ(G) = Γ(S), where S is a sporadic simple group. Let p > 3 be a prime number. In this paper we determine finite groups G such that Γ(G) = Γ(PSL(2, p)). As a consequence of our results we prove that if p > 11 is a prime number and p ≢ 1 (mod 12), then PSL(2, p) is uniquely determined by its prime graph and so these groups are characterizable by their prime graph. The third author was supported in part by a grant from IPM (No. 84200024).     

Spectral Characterization of Some Generalized Odd Graphs

Suppose G is a connected, k-regular graph such that Spec(G)=Spec(Γ) where Γ is a distance-regular graph of diameter d with parameters a ₁=a ₂=⋯=a _d−1=0 and a _d>0; i.e., a generalized odd graph, we show that G must be distance-regular with the same intersection array as that of Γ in terms of the notion of Hoffman Polynomials. Furthermore, G is isomorphic to Γ if Γ is one of the odd polygon C _2d+1, the Odd graph O _d+1, the folded (2d+1)-cube, the coset graph of binary Golay code (d=3), the Hoffman-Singleton graph (d=2), the Gewirtz graph (d=2), the Higman-Sims graph (d=2), or the second subconstituent of the Higman-Sims graph (d=2). Received: March 28, 1996 / Revised: October 20, 1997     

On the total domination subdivision numbers in graphs

A set S of vertices of a graph G = (V, E) without isolated vertex is a total dominating set if every vertex of V(G) is adjacent to some vertex in S. The total domination number γ _t (G) is the minimum cardinality of a total dominating set of G. The total domination subdivision number sd_γt (G) is the minimum number of edges that must be subdivided (each edge in G can be subdivided at most once) in order to increase the total domination number. Karami, Khoeilar, Sheikholeslami and Khodkar, (Graphs and Combinatorics, 2009, 25, 727–733) proved that for any connected graph G of order n ≥ 3, sd_{γ t} (G) ≤ 2γ _t (G) − 1 and posed the following problem: Characterize the graphs that achieve the aforementioned upper bound. In this paper we first prove that sd_{γ t} (G) ≤ 2α′(G) for every connected graph G of order n ≥ 3 and δ(G) ≥ 2 where α′(G) is the maximum number of edges in a matching in G and then we characterize all connected graphs G with sd_{γ t} (G)=2γ _t (G)−1.     

On finite Moufang polygons

We show that a finite generalized polygon Γ is Moufang with respect to a groupG if and only if for every flag {x, y} of Γ, the subgroupG ₁(x, y) ofG fixing every element incident with one ofx, y acts transitively on the set of apartments containing the elementsu, x, y, w, whereu≠y (resp.w≠x) is an arbitrary element incident withx (resp.y). Research Associate at the National Fund of Scientific Research of Belgium. Research partially supported by NSF Grant DMS-8901904.     

Unique ergodicity of flows on homogeneous spaces

LetG be a unimodular Lie group, Γ a co-compact discrete subgroup ofG and ‘a’ a semisimple element ofG. LetT _a be the mapgΓ →ag Γ:G/Γ →G/Γ. The following statements are pairwise equivalent: (1) (T _a, G/Γ,θ) is weak-mixing. (2) (T _a, G/Γ) is topologically weak-mixing. (3) (G ^u, G/Γ) is uniquely ergodic. (4) (G ^u, G/Γ,θ) is ergodic. (5) (G ^u, G/Γ) is point transitive. (6) (G ^u, G/Γ) is minimal. If in additionG is semisimple with finite center and no compact factors, then the statement “(T _a, G/Γ,θ) is ergodic” may be added to the above list. The authors were partially supported by NSF grant MCS 75-05250.     

Fitting Height and Character Degree Graphs

Given a group G, Γ(G) is the graph whose vertices are the primes that divide the degree of some irreducible character and two vertices p and q are joined by an edge if pq divides the degree of some irreducible character of G. By a definition of Lewis, a graph Γ has bounded Fitting height if the Fitting height of any solvable group G with Γ(G)=Γ is bounded (in terms of Γ). In this note, we prove that there exists a universal constant C such that if Γ has bounded Fitting height and Γ(G)=Γ then h(G)≤C. This solves a problem raised by Lewis. Research supported by the Spanish Ministerio de Educación y Ciencia, MTM2004-06067-C02-01 and MTM2004-04665, the FEDER and Programa Ramón y Cajal.     

Delsarte Set Graphs with Small c 2

Let Γ be a Delsarte set graph with an intersection number c ₂ (i.e., a distance-regular graph with a set ${\mathcal{C}}Let Γ be a Delsarte set graph with an intersection number c ₂ (i.e., a distance-regular graph with a set C{\mathcal{C}} of Delsarte cliques such that each edge lies in a positive constant number n_C{n_{\mathcal{C}}} of Delsarte cliques in C{\mathcal{C}}). We showed in Bang et al. (J Combin 28:501–506, 2007) that if ψ ₁ > 1 then c ₂ ≥ 2 ψ ₁ where y₁:=|G₁(x)?C |{\psi_1:=|\Gamma_1(x)\cap C |} for x ? V(G){x\in V(\Gamma)} and C a Delsarte clique satisfying d(x, C) = 1. In this paper, we classify Γ with the case c ₂ = 2ψ ₁ > 2. As a consequence of this result, we show that if c ₂ ≤ 5 and ψ ₁ > 1 then Γ is either a Johnson graph or a folded Johnson graph [`(J)](4s,2s){\overline{J}(4s,2s)} with s ≥ 3.     

Structure of the automorphism group for partially commutative class two nilpotent groups

Let R be a ring, which is either a ring of integers or a field of zero characteristic. For every finite graph Γ, we construct an R-arithmetic linear group H(Γ). The group H(Γ) is realized as the factor automorphism group of a partially commutative class two nilpotent R-group G _Γ. Also we describe the structure of the entire automorphism group of a partially commutative nilpotent R-group of class two.     

A Degree Sum Condition Concerning the Connectivity and the Independence Number of a Graph

Let G be a graph and S ⊂ V(G). We denote by α(S) the maximum number of pairwise nonadjacent vertices in S. For x, y ∈ V(G), the local connectivity κ(x, y) is defined to be the maximum number of internally-disjoint paths connecting x and y in G. We define . In this paper, we show that if κ(S) ≥ 3 and for every independent set {x ₁, x ₂, x ₃, x ₄} ⊂ S, then G contains a cycle passing through S. This degree condition is sharp and this gives a new degree sum condition for a 3-connected graph to be hamiltonian.     

Expanders obtained from affine transformations

A bipartite graphG=(U, V, E) is an (n, k, δ, α) expander if |U|=|V|=n, |E|≦kn, and for anyX⊆U with |X|≦αn, |Γ _G (X)|≧(1+δ(1−|X|/n)) |X|, whereΓ _G (X) is the set of nodes inV connected to nodes inX with edges inE. We show, using relatively elementary analysis in linear algebra, that the problem of estimating the coefficientδ of a bipartite graph is reduced to that of estimating the second largest eigenvalue of a matrix related to the graph. In particular, we consider the case where the bipartite graphs are defined from affine transformations, and obtain some general results on estimating the eigenvalues of the matrix by using the discrete Fourier transform. These results are then used to estimate the expanding coefficients of bipartite graphs obtained from two-dimensional affine transformations and those obtained from one-dimensional ones.     

On finite simple groups and Kneser graphs

For a finite group G let Γ(G) be the (simple) graph defined on the elements of G with an edge between two (distinct) vertices if and only if they generate G. The chromatic number of Γ(G) is considered for various non-solvable groups G.