On the commutation graph of cyclic <Emphasis Type="Italic">TI</Emphasis>-subgroups in linear groups

We study the commutation graph Γ(A) of a cyclic TI-subgroup A of order 4 in a finite group G with quasisimple generalized Fitting subgroup F*(G). It is proved that, if F*(G) is a linear group, then the graph Γ(A) is either a coclique or an edge-regular graph but not a coedge-regular graph.     

Classification of rings with toroidal Jacobson graph

Let R be a commutative ring with nonzero identity and J(R) the Jacobson radical of R. The Jacobson graph of R, denoted by J_R, is defined as the graph with vertex set RJ(R) such that two distinct vertices x and y are adjacent if and only if 1 ? xy is not a unit of R. The genus of a simple graph G is the smallest nonnegative integer n such that G can be embedded into an orientable surface S_n. In this paper, we investigate the genus number of the compact Riemann surface in which J_R can be embedded and explicitly determine all finite commutative rings R (up to isomorphism) such that J_R is toroidal.     

Quasirecognition by prime graph of <Emphasis Type="Italic">L</Emphasis><Subscript>10</Subscript>(2)

Let G be a finite group. The prime graph of G is denoted by Γ(G). The main result we prove is as follows: If G is a finite group such that Γ(G) = Γ(L ₁₀(2)) then G/O ₂(G) is isomorphic to L ₁₀(2). In fact we obtain the first example of a finite group with the connected prime graph which is quasirecognizable by its prime graph. As a consequence of this result we can give a new proof for the fact that the simple group L ₁₀(2) is uniquely determined by the set of its element orders.     

On a classical theorem on the diameter and minimum degree of a graph

In this work, we obtain good upper bounds for the diameter of any graph in terms of its minimum degree and its order, improving a classical theorem due to Erd¨os, Pach, Pollack and Tuza.We use these bounds in order to study hyperbolic graphs(in the Gromov sense). To compute the hyperbolicity constant is an almost intractable problem, thus it is natural to try to bound it in terms of some parameters of the graph. Let H(n, δ_0) be the set of graphs G with n vertices and minimum degree δ_0, and J(n, Δ) be the set of graphs G with n vertices and maximum degree Δ. We study the four following extremal problems on graphs: a(n, δ_0) = min{δ(G) | G ∈ H(n, δ_0)}, b(n, δ_0) = max{δ(G) |G ∈ H(n, δ_0)}, α(n, Δ) = min{δ(G) | G ∈ J(n, Δ)} and β(n, Δ) = max{δ(G) | G ∈ J(n, Δ)}. In particular, we obtain bounds for b(n, δ_0) and we compute the precise value of a(n, δ_0), α(n, Δ) andβ(n, Δ) for all values of n, δ_0 and Δ, respectively.     

Every graph is (2,3)-choosable

A total weighting of a graph G is a mapping ? that assigns to each element z ∈ V (G)∪E(G) a weight ?(z). A total weighting ? is proper if for any two adjacent vertices u and v, ∑ _e∈E(u) ?(e)+?(u)≠∑ _e∈E(v) ?(e)+?(v). This paper proves that if each edge e is given a set L(e) of 3 permissible weights, and each vertex v is given a set L(v) of 2 permissible weights, then G has a proper total weighting ? with ?(z) ∈ L(z) for each element z ∈ V (G)∪E(G).     

Eulerian graphs and automorphisms of a maximal graph

Let R be a commutative ring with identity. Let Γ(R) denote the maximal graph corresponding to the non-unit elements of R, i.e., Γ(R) is a graph with vertices the non-unit elements of R, where two distinct vertices a and b are adjacent if and only if there is a maximal ideal of R containing both. In this paper, we have shown that, for any finite ring R which is not a field, Γ(R) is a Euler graph if and only if R has odd cardinality. Moreover, for any finite ring R ? R ₁×R ₂× · · · ×R _n, where the R _i is a local ring of cardinality p _i ^αi for all i, and the p _i’s are distinct primes, it is shown that Aut(Γ(R)) is isomorphic to a finite direct product of symmetric groups. We have also proved that clique(G(R)’) = χ(G(R)’) for any semi-local ring R, where G(R)’ denote the comaximal graph associated to R.     

On the diameter of the intersection graph of a finite simple group

Let G be a finite group. The intersection graph Δ_G of G is an undirected graph without loops and multiple edges defined as follows: the vertex set is the set of all proper nontrivial subgroups of G, and two distinct vertices X and Y are adjacent if X ∩ Y ≠ 1, where 1 denotes the trivial subgroup of order 1. A question was posed by Shen (2010) whether the diameters of intersection graphs of finite non-abelian simple groups have an upper bound. We answer the question and show that the diameters of intersection graphs of finite non-abelian simple groups have an upper bound 28. In particular, the intersection graph of a finite non-abelian simple group is connected.     

Classification of finite commutative rings with planar,toroidal, and projective line graphs associated with Jacobson graphs

Let R be a commutative ring with nonzero identity and J(R) be the Jacobson radical of R. The Jacobson graph of R, denoted by J _R , is a graph with vertex-set R J(R), such that two distinct vertices a and b in R J(R) are adjacent if and only if 1 ? ab is not a unit of R. Also, the line graph of the Jacobson graph is denoted by L(J _R ). In this paper, we characterize all finite commutative rings R such that the graphs L(J _R ) are planar, toroidal or projective.     

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)).     

Kazhdan-Lusztig cells in some weighted Coxeter groups

Let(W,S) be a Coxeter group with S = I■J such that J consists of all universal elements of S and that I generates a finite parabolic subgroup W_I of W with w_0 the longest element of W_I. We describe all the left cells and two-sided cells of the weighted Coxeter group(W,S,L) that have non-empty intersection with W_J,where the weight function L of(W, S) is in one of the following cases:(i) max{L(s) | s ∈J} min{L(t)|t∈I};(ii) min{L(s)|s ∈J} ≥L(w_0);(iii) there exists some t ∈ I satisfying L(t) L(s) for any s ∈I-{t} and L takes a constant value L_J on J with L_J in some subintervals of [1, L(w_0)-1]. The results in the case(iii) are obtained under a certain assumption on(W, W_I).     

Some results on the annihilator graph of a commutative ring

Let R be a commutative ring. The annihilator graph of R, denoted by AG(R), is the undirected graph with all nonzero zero-divisors of R as vertex set, and two distinct vertices x and y are adjacent if and only if ann _R (xy) ≠ ann _R (x) ∪ ann _R (y), where for z ∈ R, ann _R (z) = {r ∈ R: rz = 0}. In this paper, we characterize all finite commutative rings R with planar or outerplanar or ring-graph annihilator graphs. We characterize all finite commutative rings R whose annihilator graphs have clique number 1, 2 or 3. Also, we investigate some properties of the annihilator graph under the extension of R to polynomial rings and rings of fractions. For instance, we show that the graphs AG(R) and AG(T(R)) are isomorphic, where T(R) is the total quotient ring of R. Moreover, we investigate some properties of the annihilator graph of the ring of integers modulo n, where n ? 1.     

The regular digraph of ideals of a commutative ring

Let R be a commutative ring and Max?(R) be the set of maximal ideals of R. The regular digraph of ideals of R, denoted by \(\overrightarrow{\Gamma_{\mathrm{reg}}}(R)\), is a digraph whose vertex set is the set of all non-trivial ideals of R and for every two distinct vertices I and J, there is an arc from I to J whenever I contains a J-regular element. The undirected regular (simple) graph of ideals of R, denoted by Γ_reg(R), has an edge joining I and J whenever either I contains a J-regular element or J contains an I-regular element. Here, for every Artinian ring R, we prove that |Max?(R)|?1≦ω(Γ_reg(R))≦|Max?(R)| and \(\chi(\Gamma_{\mathrm{ reg}}(R)) = 2|\mathrm{Max}\, (R)| -k-1\), where k is the number of fields, appeared in the decomposition of R to local rings. Among other results, we prove that \(\overrightarrow{\Gamma_{\mathrm{ reg}}}(R)\) is strongly connected if and only if R is an integral domain. Finally, the diameter and the girth of the regular graph of ideals of Artinian rings are determined.     

Thompson’s conjecture for the alternating group of degree 2<Emphasis Type="Italic">p</Emphasis> and 2<Emphasis Type="Italic">p</Emphasis>+1

For a finite group G denote by N(G) the set of conjugacy class sizes of G. In 1980s, J.G.Thompson posed the following conjecture: If L is a finite nonabelian simple group, G is a finite group with trivial center and N(G) = N(L), then G ? L. We prove this conjecture for an infinite class of simple groups. Let p be an odd prime. We show that every finite group G with the property Z(G) = 1 and N(G) = N(A _i ) is necessarily isomorphic to A _i , where i ∈ {2p, 2p + 1}.     

Independence numbers of random subgraphs of a distance graph

We consider the so-called distance graph G(n, 3, 1), whose vertices can be identified with three-element subsets of the set {1, 2,..., n}, two vertices being joined by an edge if and only if the corresponding subsets have exactly one common element. We study some properties of random subgraphs of G(n, 3, 1) in the Erd?s–Rényi model, in which each edge is included in the subgraph with some given probability p independently of the other edges. We find the asymptotics of the independence number of a random subgraph of G(n, 3, 1).     

Designs associated with maximum independent sets of a graph

A (v, β _o , μ)-design over regular graph G = (V, E) of degree d is an ordered pair D = (V, B), where |V| = v and B is the set of maximum independent sets of G called blocks such that if i, j ∈ V, i ≠ j and if i and j are not adjacent in G then there are exactly μ blocks containing i and j. In this paper, we study (v, β _o , μ)-designs over the graphs K _n × K _n , T(n)-triangular graphs, L ₂(n)-square lattice graphs, Petersen graph, Shrikhande graph, Clebsch graph and the Schläfli graph and non-existence of (v, β _o , μ)-designs over the three Chang graphs T ₁(8), T ₂(8) and T ₃(8).     

Finite simple groups that are not spectrum critical

Let G be a finite group. The spectrum of G is the set ω(G) of orders of all its elements. The subset of prime elements of ω(G) is called the prime spectrum and is denoted by π(G). A group G is called spectrum critical (prime spectrum critical) if, for any subgroups K and L of G such that K is a normal subgroup of L, the equality ω(L/K) = ω(G) (π(L/K) = π(G), respectively) implies that L = G and K = 1. In the present paper, we describe all finite simple groups that are not spectrum critical. In addition, we show that a prime spectrum minimal group G is prime spectrum critical if and only if its Fitting subgroup F(G) is a Hall subgroup of G.     

Strictly Deza line graphs

For a given graph G, its line graph L(G) is defined as the graph with vertex set equal to the edge set of G in which two vertices are adjacent if and only if the corresponding edges of G have exactly one common vertex. A k-regular graph of diameter 2 on υ vertices is called a strictly Deza graph with parameters (υ, k, b, a) if it is not strongly regular and any two vertices have a or b common neighbors. We give a classification of strictly Deza line graphs.     

Structure of Abelian rings

Let R be a ring with identity. We use J(R); G(R); and X(R) to denote the Jacobson radical, the group of all units, and the set of all nonzero nonunits in R; respectively. A ring is said to be Abelian if every idempotent is central. It is shown, for an Abelian ring R and an idempotent-lifting ideal N ? J(R) of R; that R has a complete set of primitive idempotents if and only if R/N has a complete set of primitive idempotents. The structure of an Abelian ring R is completely determined in relation with the local property when X(R) is a union of 2; 3; 4; and 5 orbits under the left regular action on X(R) by G(R): For a semiperfect ring R which is not local, it is shown that if G(R) is a cyclic group with 2 ∈ G(R); then R is finite. We lastly consider two sorts of conditions for G(R) to be an Abelian group.     

A note on commuting automorphisms of some finite <Emphasis Type="Italic">p</Emphasis>-groups

An automorphism α of a group G is called a commuting automorphism if each element x in G commutes with its image α(x) under α. Let A(G) denote the set of all commuting automorphisms of G. Rai [Proc. Japan Acad., Ser. A 91 (5), 57–60 (2015)] has given some sufficient conditions on a finite p-group G such that A(G) is a subgroup of Aut(G) and, as a consequence, has proved that, in a finite p-group G of co-class 2, where p is an odd prime, A(G) is a subgroup of Aut(G). We give here very elementary and short proofs of main results of Rai.