Hitting times for random walks on subdivision and triangulation graphs

Let G be a connected graph. The subdivision graph of G, denoted by S(G), is the graph obtained from G by inserting a new vertex into every edge of G. The triangulation graph of G, denoted by R(G), is the graph obtained from G by adding, for each edge uv, a new vertex whose neighbours are u and v. In this paper, we first provide complete information for the eigenvalues and eigenvectors of the probability transition matrix of a random walk on S(G) (res. R(G)) in terms of those of G. Then we give an explicit formula for the expected hitting time between any two vertices of S(G) (res. R(G)) in terms of those of G. Finally, as applications, we show that, the relations between the resistance distances, the number of spanning trees and the multiplicative degree-Kirchhoff index of S(G) (res. R(G)) and G can all be deduced from our results directly.     

The converse of Schur’s theorem

Schur’s theorem states that for a group G finiteness of G/Z(G) implies the finiteness of G′. In this paper, we show the converse is true provided that G/Z(G) is finitely generated and in such case, we have |G/Z(G)| ≤ |G′| ^d(G/Z(G)). In the special case of G being nilpotent, we prove |G/Z(G)| divides |G′| ^d(G/Z(G)).     

Complete reducibility of subgroups of reductive algebraic groups over nonperfect fields III

Let G be a reductive group over a nonperfect field k. We study rationality problems for Serre’s notion of complete reducibility of subgroups of G. In our previous work, we constructed examples of subgroups H of G that are G-completely reducible but not G-completely reducible over k (and vice versa). In this article, we give a theoretical underpinning of those constructions. Then using Geometric Invariant Theory, we obtain a new result on the structure of G(k)-(and G-) orbits in an arbitrary affine G-variety. We discuss several related problems to complement the main results.     

On purifiable subgroups in arbitrary abelian groups

We determine the structure of a p-pure[pure] hull of a p-purifiable [purifiable] subgroup of an arbitrary abelian group. Moreover, we prove that a subgroup A of an abelian group G is purifiable in G if and only if A is p-purifiable in G for every prime p. Using these results, we characterize the groups G for which all subgroups are purifiable in G. Furthermore, we establish several properties of purifiable subgroups.     

Non-Nilpotent Graph of a Group

We associate a graph 𝒩 _G with a group G (called the non-nilpotent graph of G) as follows: take G as the vertex set and two vertices are adjacent if they generate a non-nilpotent subgroup. In this article, we study the graph theoretical properties of 𝒩 _G and its induced subgraph on G \ nil(G), where nil(G) = {x ∈ G | ? x, y ? is nilpotent for all y ∈ G}. For any finite group G, we prove that 𝒩 _G has either |Z*(G)| or |Z*(G)| +1 connected components, where Z*(G) is the hypercenter of G. We give a new characterization for finite nilpotent groups in terms of the non-nilpotent graph. In fact, we prove that a finite group G is nilpotent if and only if the set of vertex degrees of 𝒩 _G has at most two elements.     

Tutte sets in graphs I: Maximal tutte sets and D‐graphs

A well‐known formula of Tutte and Berge expresses the size of a maximum matching in a graph G in terms of what is usually called the deficiency of G. A subset X of V(G) for which this deficiency is attained is called a Tutte set of G. While much is known about maximum matchings, less is known about the structure of Tutte sets. In this article, we study the structural aspects of maximal Tutte sets in a graph G. Towards this end, we introduce a related graph D(G). We first show that the maximal Tutte sets in G are precisely the maximal independent sets in its D‐graph D(G), and then continue with the study of D‐graphs in their own right, and of iterated D‐graphs. We show that G is isomorphic to a spanning subgraph of D(G), and characterize the graphs for which G?D(G) and for which D(G)?D²(G). Surprisingly, it turns out that for every graph G with a perfect matching, D³(G)?D²(G). Finally, we characterize bipartite D‐graphs and comment on the problem of characterizing D‐graphs in general. © 2007 Wiley Periodicals, Inc. J Graph Theory 55: 343–358, 2007     

Central Automorphisms and Inner Automorphisms in Finitely Generated Groups

Let G be a group and Aut_c(G) be the group of all central automorphisms of G. We know that in a finite p-group G, Aut_c(G) = Inn(G) if and only if Z(G) = G′ and Z(G) is cyclic. But we shown that we cannot extend this result for infinite groups. In fact, there exist finitely generated nilpotent groups of class 2 in which G′ =Z(G) is infinite cyclic and Inn(G) < C* = Aut_c(G). In this article, we characterize all finitely generated groups G for which the equality Aut_c(G) = Inn(G) holds.     

A decomposition theorem for G-groups

Some classical results about linear representations of a finite group G have been also proved for representations of G on non-abelian groups （G-groups）. In this paper we establish a decomposition theorem for irreducible G-groups which expresses a suitable irreducible G-group as a tensor product of two projective G-groups in a similar way to the celebrated theorem of Clifford for linear representations. Moreover, we study the non-abelian minimal normal subgroups of G in which this decomposition is possible.     

Commuting graphs of groups and related numerical parameters

Given a finite group G, we denote by Δ(G) the commuting graph of G which is defined as follows: the vertex set is G and two distinct vertices x and y are joined by an edge if and only if xy = yx. Clearly, Δ(G) is always connected for any group G. We denote by κ(G) the number of spanning trees of Δ(G). In the present paper, among other results, we first obtain the value κ(G) for some specific groups G, such as Frobenius groups, Dihedral groups, AC-groups, etc. Next, we characterize the alternating group A₅, in the class of nonsolvable groups through its tree-number κ(A₅). Finally, we classify the finite groups for which the power graph and the commuting graph coincide.     

Automorphisms of Hyperbolic Groups and Graphs of Groups

Using the canonical JSJ splitting, we describe the outer automorphism group Out(G) of a one-ended word hyperbolic group G. In particular, we discuss to what extent Out(G) is virtually a direct product of mapping class groups and a free abelian group, and we determine for which groups Out(G) is infinite. We also show that there are only finitely many conjugacy classes of torsion elements in Out(G), for G any torsion-free hyperbolic group. More generally, let Γ be a finite graph of groups decomposition of an arbitrary group G such that edge groups G_e are rigid (i.e. Out(G_e) is finite). We describe the group of automorphisms of G preserving Γ, by comparing it to direct products of suitably defined mapping class groups of vertex groups.     

On the character degree sums

Let G be a finite group, and T(G) be the sum of all complex irreducible character degrees of G. In this paper, we get the exact lower bound of |G|∕T(G) for a non-r-solvable group G.     

The nonorientable genus is additive

A graph G is a k-amalgamation of two graphs G₁ and G₂ if G = G₁ ∪ G₂ and G₁ ∩G₂ is a set of k vertices. In this paper we show that γ(G) differs from γ(G₁) + γ(G₂) by at most a quadratic on k, where γ denotes the nonorientable genus of a graph. In the sequel to this paper we show that no such bound holds for the orientable genus of k-amalgamations.     

The chromatic numbers of double coverings of a graph

If we fix a spanning subgraph H of a graph G, we can define a chromatic number of H with respect to G and we show that it coincides with the chromatic number of a double covering of G with co-support H. We also find a few estimations for the chromatic numbers of H with respect to G.     

Improved bounds for the chromatic index of graphs and multigraphs

We show that coloring the edges of a multigraph G in a particular order often leads to improved upper bounds for the chromatic index χ′(G). Applying this to simple graphs, we significantly generalize recent conditions based on the core of G 〈i.e., the subgraph of G induced by the vertices of degree Δ(G)〉, which insure that χ′(G) = Δ(G). Finally, we show that in any multigraph G in which every cycle of length larger than 2 contains a simple edge, where μ(G) is the largest edge multiplicity in G. © 1999 John Wiley & Sons, Inc. J Graph Theory 32: 311–326, 1999     

The co-degrees of irreducible characters

LetG be a finite group. The co-degree of an irreducible character χ ofG is defined to be the number |G|/χ(1). The set of all prime divisors of all the co-degrees of the nonlinear irreducible characters ofG is denoted by Σ(G). First we show that Σ(G)=π(G) (the set of all prime divisors of |G|) unlessG is nilpotent-by-abelian. Then we make Σ(G) a graph by adjoining two elements of Σ(G) if and only if their product divides a co-degree of some nonlinear character ofG. We show that the graph Σ(G) is connected and has diameter at most 2. Additional information on the graph is given. These results are analogs to theorems obtained for the graph corresponding to the character degrees (by Manz, Staszewski, Willems and Wolf) and for the graph corresponding to the class sizes (by Bertram, Herzog and Mann). Finally, we investigate groups with some restriction on the co-degrees. Among other results we show that ifG has a co-degree which is ap-power for some primep, then the corresponding character is monomial andO _p (G)≠1. Also we describe groups in which each co-degree of a nonlinear character is divisible by at most two primes. These results generalize results of Chillag and Herzog. Other results are proved as well. The paper was written during this author’s visit at the Technion and the University of Tel Aviv. He would like to thank the departments of mathematics at the Technion and the University of Tel Aviv for their hospitality and support.     

Isomorphisms of Connected Cayley Digraphs

 Let G be a finite group and let Cay() be a Cayley graph of G. The graph Cay() is called a CI-graph of G if, for any for some Aut(G) only when CayCay(). In this paper, we study the isomorphism problem of connected Cayley graphs: to determine the groups G (or the types of Cayley graphs for a given group G) for which all connected Cayley graphs for G are CI-graphs.     

On a Commuting Graph on Conjugacy Classes of Groups

We consider the graph Γ(G), associated with the conjugacy classes of a group G. Its vertices are the nontrivial conjugacy classes of G, and we join two different classes C, D, whenever there exist x ∈ G and y ∈ D such that xy = yx. The aim of this article is twofold. First, we investigate which graphs can occur in various contexts and second, given a graph Γ(G) associated with G, we investigate the possible structure of G. We proved that if G is a periodic solvable group, then Γ(G) has at most two components, each of diameter at most 9. If G is any locally finite group, then Γ(G) has at most 6 components, each of diameter at most 19. Finally, we investigated periodic groups G with Γ(G) satisfying one of the following properties: (i) no edges exist between noncentral conjugacy classes, and (ii) no edges exist between infinite conjugacy classes. In particular, we showed that the only nonabelian groups satisfying (i) are the three finite groups of order 6 and 8.     

Graphs satisfying inequality θ(G)θ(G)

In this paper, we study the edge clique cover number of squares of graphs. More specifically, we study the inequality θ(G²)θ(G) where θ(G) is the edge clique cover number of a graph G. We show that any graph G with at most θ(G) vertices satisfies the inequality. Among the graphs with more than θ(G) vertices, we find some graphs violating the inequality and show that dually chordal graphs and power-chordal graphs satisfy the inequality. Especially, we give an exact formula computing θ(T²) for a tree T.     

Mean-field backward stochastic differential equations driven by G-Brownian motion and related partial differential equations

In this paper, we study mean-field backward stochastic differential equations driven by G-Brownian motion (G-BSDEs). We first obtain the existence and uniqueness theorem of these equations. In fact, we can obtain local solutions by constructing Picard contraction mapping for Y term on small interval, and the global solution can be obtained through backward iteration of local solutions. Then, a comparison theorem for this type of mean-field G-BSDE is derived. Furthermore, we establish the connection of this mean-field G-BSDE and a nonlocal partial differential equation. Finally, we give an application of mean-field G-BSDE in stochastic differential utility model.