On the Genus of the Nilpotent Graphs of Finite Groups

The nilpotent graph of a group G is a simple graph whose vertex set is G?nil(G), where nil(G) = {y ∈ G | ? x, y ? is nilpotent ? x ∈ G}, and two distinct vertices x and y are adjacent if ? x, y ? is nilpotent. In this article, we show that the collection of finite non-nilpotent groups whose nilpotent graphs have the same genus is finite, derive explicit formulas for the genus of the nilpotent graphs of some well-known classes of finite non-nilpotent groups, and determine all finite non-nilpotent groups whose nilpotent graphs are planar or toroidal.     

Thomassen's conjecture implies polynomiality of 1‐Hamilton‐connectedness in line graphs

A graph G is 1‐Hamilton‐connected if G?x is Hamilton‐connected for every x∈V(G), and G is 2‐edge‐Hamilton‐connected if the graph G+ X has a hamiltonian cycle containing all edges of X for any X?E⁺(G) = {xy| x, y∈V(G)} with 1≤|X|≤2. We prove that Thomassen's conjecture (every 4‐connected line graph is hamiltonian, or, equivalently, every snark has a dominating cycle) is equivalent to the statements that every 4‐connected line graph is 1‐Hamilton‐connected and/or 2‐edge‐Hamilton‐connected. As a corollary, we obtain that Thomassen's conjecture implies polynomiality of both 1‐Hamilton‐connectedness and 2‐edge‐Hamilton‐connectedness in line graphs. Consequently, proving that 1‐Hamilton‐connectedness is NP‐complete in line graphs would disprove Thomassen's conjecture, unless P = NP. © 2011 Wiley Periodicals, Inc. J Graph Theory 69: 241–250, 2012     

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.     

Irreducible Divisor Graphs II

Let R be an integral domain, and let x ∈ R be a nonzero nonunit that can be written as a product of irreducibles. Coykendall and Maney (to appear), defined the irreducible divisor graph of x, denoted G(x), as follows. The vertices of G(x) are the nonassociate irreducible divisors of x (each from a pre-chosen coset of the form π U(R) for π ∈ R irreducible). Given distinct vertices y and z, we put an edge between y and z if and only if yz|x. Finally, if y ⁿ |x but y ⁿ⁺¹ ? x, then we put n ? 1 loops on the vertex y.

In this article, inspired by the approach of the authors from Akhtar and Lee (to appear Akhtar , R. , Lee , L. Homology of zero divisors . To appear in Rocky Mountain J. Math.  [Google Scholar]), we study G(x) using homology. A connection is found between H ₁ and the cycle space of G(x). We also characterize UFDs via these homology groups.     

Common Divisor Character Degree Graphs of Solvable Groups with Four Vertices

Let G be a finite solvable group. The common divisor graph Γ(G) attached to G is a character degree graph. Its vertices are the degrees of the nonlinear irreducible complex characters of G, and different vertices m, n are adjacent if the greatest common divisor (m, n) > 1. In this article, we classify all graphs with four vertices that may occur as Γ(G) for solvable group G.     

Divisibility Graph for Symmetric and Alternating Groups

Let X be a nonempty set of positive integers and X* = X?{1}. The divisibility graph D(X) has X* as the vertex set, and there is an edge connecting a and b with a, b ∈ X* whenever a divides b or b divides a. Let X = cs(G) be the set of conjugacy class sizes of a group G. In this case, we denote D(cs(G)) by D(G). In this paper, we will find the number of connected components of D(G) where G is the symmetric group S _n or is the alternating group A _n .     

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.     

Inverse Problems for Time-Dependent Singular Heat Conductivities: Multi-Dimensional Case

We consider an inverse boundary value problem for the heat equation ? _t u = div (γ? _x u) in (0, T) × Ω, u = f on (0, T) × ?Ω, u| _t=0 = u ₀, in a bounded domain Ω ? ? ⁿ , n ≥ 2, where the heat conductivity γ(t, x) is piecewise constant and the surface of discontinuity depends on time: γ(t, x) = k ² (x ∈ D(t)), γ(t, x) = 1 (x ∈ Ω?D(t)). Fix a direction e* ∈ 𝕊 ^n?1 arbitrarily. Assuming that ?D(t) is strictly convex for 0 ≤ t ≤ T, we show that k and sup {e*·x; x ∈ D(t)} (0 ≤ t ≤ T), in particular D(t) itself, are determined from the Dirichlet-to-Neumann map : f → ?_ν u(t, x)|_{(0, T)×?Ω}. The knowledge of the initial data u ₀ is not used in the proof. If we know min_0≤t≤T (sup _x∈D(t) x·e*), we have the same conclusion from the local Dirichlet-to-Neumann map. Numerical examples of stationary and moving circles inside the unit disk are shown. The results have applications to nondestructive testing. Consider a physical body consisting of homogeneous material with constant heat conductivity except for a moving inclusion with different conductivity. Then the location and shape of the inclusion can be monitored from temperature and heat flux measurements performed at the boundary of the body. Such a situation appears for example in blast furnaces used in ironmaking.     

<Emphasis Type="Italic">C</Emphasis><Superscript>*</Superscript>-Subalgebras Generated by a Single Operator in <Emphasis Type="Italic">B</Emphasis>(<Emphasis Type="Italic">H</Emphasis>)

In this paper, we characterize a C ^*-subalgebra C ^*(x) of B(H), generated by a single operator x. We show that if x is polar-decomposed by aq, where a is the partial isometry part and q is the positive operator part of x, then C ^*(x) is *-isomorphic to the groupoid crossed product algebra A_q×_a\mathbbG_a\mathcal{A}_{q}\times_{\alpha }\mathbb{G}_{a} , where A_q=C^*(q)\mathcal{A}_{q}=C^{*}(q) and \mathbbG_a\mathbb{G}_{a} is the graph groupoid induced by a partial isometry part a of x.     

On the Prime Ideal Structure of Bhargava Rings

Let D be an integral domain with quotient field K. A Bhargava ring over D is defined to be 𝔹 _x (D): = {f ∈ K[X] | ? a ∈ D, f(xX + a) ∈ D[X]}, where x ∈ D. A Bhargava ring over D is a subring of the ring of integer-valued polynomials over D. In this article, we study the prime ideal structure and calculate the Krull and valuative dimension of Bhargava rings over a general domain D.     

On a bipartition problem of Bollobás and Scott

The bipartite density of a graph G is max {|E(H)|/|E(G)|: H is a bipartite subgraph of G}. It is NP-hard to determine the bipartite density of any triangle-free cubic graph. A biased maximum bipartite subgraph of a graph G is a bipartite subgraph of G with the maximum number of edges such that one of its partite sets is independent in G. Let $ \mathcal{H} $ \mathcal{H} denote the collection of all connected cubic graphs which have bipartite density $ \tfrac{4} {5} $ \tfrac{4} {5} and contain biased maximum bipartite subgraphs. Bollobás and Scott asked which cubic graphs belong to $ \mathcal{H} $ \mathcal{H} . This same problem was also proposed by Malle in 1982. We show that any graph in $ \mathcal{H} $ \mathcal{H} can be reduced, through a sequence of three types of operations, to a member of a well characterized class. As a consequence, we give an algorithm that decides whether a given graph G belongs to $ \mathcal{H} $ \mathcal{H} . Our algorithm runs in polynomial time, provided that G has a constant number of triangles that are not blocks of G and do not share edges with any other triangles in G.     

Vanishing Derivations and Co-Centralizing Generalized Derivations on Multilinear Polynomials in Prime Rings

Let R be a noncommutative prime ring of characteristic different from 2 with Utumi quotient ring U and extended centroid C, and f(x₁,…, x_n) be a multilinear polynomial over C, which is not central valued on R. Suppose that F and G are two generalized derivations of R and d is a nonzero derivation of R such that d(F(f(r))f(r) ? f(r)G(f(r))) = 0 for all r = (r₁,…, r_n) ∈ Rⁿ, then one of the following holds:

1. There exist a, p, q, c ∈ U and λ ∈C such that F(x) = ax + xp + λx, G(x) = px + xq and d(x) = [c, x] for all x ∈ R, with [c, a ? q] = 0 and f(x₁,…, x_n)² is central valued on R;

2. There exists a ∈ U such that F(x) = xa and G(x) = ax for all x ∈ R;

3. There exist a, b, c ∈ U and λ ∈C such that F(x) = λx + xa ? bx, G(x) = ax + xb and d(x) = [c, x] for all x ∈ R, with b + αc ∈ C for some α ∈C;

4. R satisfies s₄ and there exist a, b ∈ U and λ ∈C such that F(x) = λx + xa ? bx and G(x) = ax + xb for all x ∈ R;

5. There exist a′, b, c ∈ U and δ a derivation of R such that F(x) = a′x + xb ? δ(x), G(x) = bx + δ(x) and d(x) = [c, x] for all x ∈ R, with [c, a′] = 0 and f(x₁,…, x_n)² is central valued on R.

     

Some properties for the largest component of random geometric graphs with applications in sensor networks

In this paper we consider the standard Poisson Boolean model of random geometric graphs G（Hλ,s; 1） in Rd and study the properties of the order of the largest component L1 （G（Hλ,s; 1）） . We prove that ElL1 （G（Hλ,s; 1））] is smooth with respect to A, and is derivable with respect to s. Also, we give the expression of these derivatives. These studies provide some new methods for the theory of the largest component of finite random geometric graphs （not asymptotic graphs as s - co） in the high dimensional space （d 〉 2）. Moreover, we investigate the convergence rate of E[L1（G（Hλ,s; 1））]. These results have significance for theory development of random geometric graphs and its practical application. Using our theories, we construct and solve a new optimal energy-efficient topology control model of wireless sensor networks, which has the significance of theoretical foundation and guidance for the design of network layout.     

Ideals Generated by Diagonal 2-Minors

With a simple graph G on [n], we associate a binomial ideal P_G generated by diagonal minors of an n × n matrix X = (x_ij) of variables. We show that for any graph G, P_G is a prime complete intersection ideal and determine the divisor class group of K[X]/P_G. By using these ideals, one may find a normal domain with free divisor class group of any given rank.     

Some Remarks on the Graph Γ I (R)

Let R be a commutative ring with nonzero identity and Z(R) its set of zero-divisors. The zero-divisor graph of R is Γ(R), with vertices Z(R)?{0} and distinct vertices x and y are adjacent if and only if xy = 0. For a proper ideal I of R, the ideal-based zero-divisor graph of R is Γ _I (R), with vertices {x ∈ R?I | xy ∈ I for some y ∈ R?I} and distinct vertices x and y are adjacent if and only if xy ∈ I. In this article, we study the relationship between the two graphs Γ(R) and Γ _I (R). We also determine when Γ _I (R) is either a complete graph or a complete bipartite graph and investigate when Γ _I (R) ? Γ(S) for some commutative ring S.     

Noncyclic Graph of a Group

We associate a graph Γ _G to a nonlocally cyclic group G (called the noncyclic graph of G) as follows: take G\ Cyc(G) as vertex set, where Cyc(G) = {x ? G| 〈x, y〉 is cyclic for all y ? G}, and join two vertices if they do not generate a cyclic subgroup. We study the properties of this graph and we establish some graph theoretical properties (such as regularity) of this graph in terms of the group ones. We prove that the clique number of Γ _G is finite if and only if Γ _G has no infinite clique. We prove that if G is a finite nilpotent group and H is a group with Γ _G  ? Γ _H and |Cyc(G)| = |Cyc(H)| = 1, then H is a finite nilpotent group. We give some examples of groups G whose noncyclic graphs are “unique”, i.e., if Γ _G  ? Γ _H for some group H, then G ? H. In view of these examples, we conjecture that every finite nonabelian simple group has a unique noncyclic graph. Also we give some examples of finite noncyclic groups G with the property that if Γ _G  ? Γ _H for some group H, then |G| = |H|. These suggest the question whether the latter property holds for all finite noncyclic groups.     

A General Theory of Almost Splitting Sets

Let * be a star-operation of finite type on an integral domain D. In this paper, we generalize and study the concept of almost splitting sets. We define a saturated multiplicative subset S of D to be an almost g*-splitting set of D if for each 0 ≠ d ∈ D, there exists an integer n = n(d) ≥1 such that d ⁿ  = st for some s ∈ S and t ∈ D with (t, s′)_* = D for all s′ ∈ S. Among other things, we prove that every saturated multiplicative subset of D is an almost g*-splitting set if and only if D is an almost weakly factorial domain (AWFD) with *-dim (D) = 1. We also give an example of an almost g*-splitting set which is not a g*-splitting set.     

Generalized skew derivations on triangular algebras determined by action on zero products

For a triangular algebra 𝒜 and an automorphism σ of 𝒜, we describe linear maps F,G:𝒜→𝒜 satisfying F(x)y+σ(x)G(y) = 0 whenever x,y∈𝒜 are such that xy = 0. In particular, when 𝒜 is a zero product determined triangular algebra, maps F and G satisfying the above condition are generalized skew derivations of the form F(x) = F(1)x+D(x) and G(x) = σ(x)G(1)+D(x) for all x∈𝒜, where D:𝒜→𝒜 is a skew derivation. When 𝒜 is not zero product determined, we show that there are also nonstandard solutions for maps F and G.     

Annihilator Ideal-Based Zero-Divisor Graphs Over Multiplication Modules

For a commutative ring R with identity, an ideal-based zero-divisor graph, denoted by Γ _I (R), is the graph whose vertices are {x ∈ R?I | xy ∈ I for some y ∈ R?I}, and two distinct vertices x and y are adjacent if and only if xy ∈ I. In this article, we investigate an annihilator ideal-based zero-divisor graph by replacing the ideal I with the annihilator ideal Ann(M) for a multiplication R-module M. Based on the above-mentioned definition, we examine some properties of an R-module over a von Neumann regular ring, and the cardinality of an R-module associated with Γ _Ann(M)(R).