Degree Sums,Connectivity and Dominating Cycles in Graphs

Let G be a graph of order n with connectivity κ≥3 and let α be the independence number of G. Set σ₄(G)= min{∑⁴ _{i =1} d(x _i ):{x ₁,x ₂,x ₃,x ₄} is an independent set of G}. In this paper, we will prove that if σ₄(G)≥n+2κ, then there exists a longest cycle C of G such that V(G−C) is an independent set of G. Furthermore, if the minimum degree of G is at least α, then G is hamiltonian. Received: July 31, 1998?Final version received: October 4, 2000     

Diffusion approximation for the convection-diffusion equation with random drift

We consider the asymptotic behavior of the solutions ofscaled convection-diffusion equations ∂ _t u _ɛ (t, x) = κΔ _x (t, x) + 1/ɛV(t/ɛ²,xɛ) ·∇ _x u _ɛ (t, x) with the initial condition u _ɛ(0,x) = u ₀(x) as the parameter ɛ↓ 0. Under the assumptions that κ > 0 and V(t, x), (t, x) ∈R ^d is a d-dimensional,stationary, zero mean, incompressible, Gaussian random field, Markovian and mixing in t we show that the laws of u _ɛ(t,·), t≥ 0 in an appropriate functional space converge weakly, as ɛ↓ 0, to a δ-type measureconcentrated on a solution of a certain constant coefficient heat equation. Received: 23 March 2000 / Revised version: 5 March 2001 / Published online: 9 October 2001     

3-restricted connectivity of graphs with given girth

Let G = （V, E） be a connected graph. X belong to V（G） is a vertex set. X is a 3-restricted cut of G, if G- X is not connected and every component of G- X has at least three vertices. The 3-restricted connectivity κ3（G） （in short κ3） of G is the cardinality of a minimum 3-restricted cut of G. X is called κ3-cut, if ｜X｜ = κ3. A graph G is κ3-connected, if a 3-restricted cut exists. Let G be a graph girth g ≥ 4, κ3（G） is min{d（x） ＋ d（y） ＋ d（z） - 4 ： xyz is a 2-path of G}. It will be shown that κ3（G） = ξ3（G） under the condition of girth.     

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.     

Beurling primes with large oscillation

A Beurling generalized number system is constructed having integer counting function N_B(x) = κx +O(x^θ) with κ>0 and 1/2 <θ <1, whose prime counting function satisfies the oscillation estimate π_B(x) =li(x) + Ω(xexp(-c)), and whose zeta function has infinitely many zeros on the curve σ=1−a/logt, t≥2, and no zero to the right of this curve, where a is chosen so that a>(4/e)(1−θ). The construction uses elements of classical analytic number theory and probability. The author was supported in part by NSF grants DMS-0070720 and DMS-0244660. The author was supported in part by NSF grant DMS-0244660.     

On the Existence of a Long Path Between Specified Vertices in a 2-Connected Graph

 Let G be a 2-connected graph with maximum degree Δ (G)≥d, and let x and y be distinct vertices of G. Let W be a subset of V(G)−{x, y} with cardinality at most d−1. Suppose that max{d _G(u), d _G(v)}≥d for every pair of vertices u and v in V(G)−({x, y}∪W) with d _G(u,v)=2. Then x and y are connected by a path of length at least d−|W|. Received: February 5, 1998 Revised: April 13, 1998     

Sharp estimation of the almost-sure Lyapunov exponent for the Anderson model in continuous space

In this article we study the exponential behavior of the continuous stochastic Anderson model, i.e. the solution of the stochastic partial differential equation u(t,x)=1+∫₀^tκΔ_xu (s,x) ds+∫₀^t W(ds,x) u (s,x), when the spatial parameter x is continuous, specifically x∈R, and W is a Gaussian field on R₊×R that is Brownian in time, but whose spatial distribution is widely unrestricted. We give a partial existence result of the Lyapunov exponent defined as lim_t→∞t⁻¹ log u(t,x). Furthermore, we find upper and lower bounds for lim sup_t→∞t⁻¹ log u(t,x) and lim inf_t→∞t⁻¹ log u(t,x) respectively, as functions of the diffusion constant κ which depend on the regularity of W in x. Our bounds are sharper, work for a wider range of regularity scales, and are significantly easier to prove than all previously known results. When the uniform modulus of continuity of the process W is in the logarithmic scale, our bounds are optimal. This author's research partially supported by NSF grant no. : 0204999     

Longest Paths and Longest Cycles in Graphs with Large Degree Sums

 Let p(G) and c(G) denote the number of vertices in a longest path and a longest cycle, respectively, of a finite, simple graph G. Define σ₄(G)=min{d(x ₁)+d(x ₂)+ d(x ₃)+d(x ₄) | {x ₁,…,x ₄} is independent in G}. In this paper, the difference p(G)−c(G) is considered for 2-connected graphs G with σ₄(G)≥|V(G)|+3. Among others, we show that p(G)−c(G)≤2 or every longest path in G is a dominating path. Received: August 28, 2000 Final version received: May 23, 2002     

Correlation structure of intermittency in the parabolic Anderson model

Consider the Cauchy problem ∂u(x, t)/∂t = ℋu(x, t) (x∈ℤ^d, t≥ 0) with initial condition u(x, 0) ≡ 1 and with ℋ the Anderson Hamiltonian ℋ = κΔ + ξ. Here Δ is the discrete Laplacian, κ∈ (0, ∞) is a diffusion constant, and ξ = {ξ(x): x∈ℤ ^d } is an i.i.d.random field taking values in ℝ. G?rtner and Molchanov (1990) have shown that if the law of ξ(0) is nondegenerate, then the solution u is asymptotically intermittent. In the present paper we study the structure of the intermittent peaks for the special case where the law of ξ(0) is (in the vicinity of) the double exponential Prob(ξ(0) > s) = exp[−e ^{s /θ}] (s∈ℝ). Here θ∈ (0, ∞) is a parameter that can be thought of as measuring the degree of disorder in the ξ-field. Our main result is that, for fixed x, y∈ℤ ^d and t→∈, the correlation coefficient of u(x, t) and u(y, t) converges to ∥w _ρ∥⁻² _ℓ2Σ_{z ∈ℤd} w _ρ(x+z)w _ρ(y+z). In this expression, ρ = θ/κ while w _ρ:ℤ^d→ℝ⁺ is given by w _ρ = (v _ρ)^{⊗ d} with v _ρ: ℤ→ℝ⁺ the unique centered ground state (i.e., the solution in ℓ²(ℤ) with minimal l ²-norm) of the 1-dimensional nonlinear equation Δv + 2ρv log v = 0. The uniqueness of the ground state is actually proved only for large ρ, but is conjectured to hold for any ρ∈ (0, ∞). empty It turns out that if the right tail of the law of ξ(0) is thicker (or thinner) than the double exponential, then the correlation coefficient of u(x, t) and u(y, t) converges to δ _{x, y} (resp.the constant function 1). Thus, the double exponential family is the critical class exhibiting a nondegenerate correlation structure. Received: 5 March 1997 / Revised version: 21 September 1998     

Super Connectivity and Super Edge Connectivity of the Mycielskian of a Graph

Mycielski introduced a new graph transformation μ(G) for graph G, which is called the Mycielskian of G. A graph G is super connected or simply super-κ (resp. super edge connected or super-λ), if every minimum vertex cut (resp. minimum edge cut) isolates a vertex of G. In this paper, we show that for a connected graph G with |V(G)| ≥ 2, μ(G) is super-κ if and only if δ(G) < 2κ(G), and μ(G) is super-λ if and only if G\ncong K₂{G\ncong K_2}.     

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.     

Factors and Connected Induced Subgraphs

 Let G be a connected graph without loops and without multiple edges, and let p be an integer such that 0 < p<|V(G)|. Let f be an integer-valued function on V(G) such that 2≤f(x)≤ deg _G (x) for all x∈V(G). We show that if every connected induced subgraph of order p of G has an f-factor, then G has an f-factor, unless ∑ _{x ∈ V ( G )} f(x) is odd. Received: June 29, 1998?Final version received: July 30, 1999     

Possible limit laws for entrance times of an ergodic aperiodic dynamical system

LetG denote the set of decreasingG: ℝ→ℝ withGэ1 on ]−∞,0], and ƒ ₀ ^∞ G(t)dt⩽1. LetX be a compact metric space, andT: X→X a continuous map. Let μ denone aT-invariant ergodic probability measure onX, and assume (X, T, μ) to be aperiodic. LetU⊂X be such that μ(U)>0. Let τ _U (x)=inf{k⩾1:T ^k xεU}, and defineG _U (t)=1/u(U)u({xεU:u(U)τU(x)>t),tεℝ We prove that for μ-a.e.x∈X, there exists a sequence (U _n ) _n≥1 of neighbourhoods ofx such that {x}=∩ _n U _n , and for anyG ∈G, there exists a subsequence (n _k ) _k≥1 withG _{U n k} ↑U weakly. We also construct a uniquely ergodic Toeplitz flowO(x ^∞,S, μ), the orbit closure of a Toeplitz sequencex ^∞, such that the above conclusion still holds, with moreover the requirement that eachU _n be a cylinder set. In memory of Anzelm Iwanik     

Almost sure asymptotics for the continuous parabolic Anderson model

We consider the parabolic Anderson problem ∂ _t u = κΔu + ξ(x)u on ℝ₊×ℝ ^d with initial condition u(0,x) = 1. Here κ > 0 is a diffusion constant and ξ is a random homogeneous potential. We concentrate on the two important cases of a Gaussian potential and a shot noise Poisson potential. Under some mild regularity assumptions, we derive the second-order term of the almost sure asymptotics of u(t, 0) as t→∞. Received: 26 July 1999 / Revised version: 6 April 2000 / Published online: 22 November 2000     

An Application of a Mountain Pass Theorem

We are concerned with the following Dirichlet problem: −Δu(x) = f(x, u), x∈Ω, u∈H ¹ ₀(Ω), (P) where f(x, t) ∈C (×ℝ), f(x, t)/t is nondecreasing in t∈ℝ and tends to an L ^∞-function q(x) uniformly in x∈Ω as t→ + ∞ (i.e., f(x, t) is asymptotically linear in t at infinity). In this case, an Ambrosetti-Rabinowitz-type condition, that is, for some θ > 2, M > 0, 0 > θF(x, s) ≤f(x, s)s, for all |s|≥M and x∈Ω, (AR) is no longer true, where F(x, s) = ∫ ^s ₀ f(x, t)dt. As is well known, (AR) is an important technical condition in applying Mountain Pass Theorem. In this paper, without assuming (AR) we prove, by using a variant version of Mountain Pass Theorem, that problem (P) has a positive solution under suitable conditions on f(x, t) and q(x). Our methods also work for the case where f(x, t) is superlinear in t at infinity, i.e., q(x) ≡ +∞. Received June 24, 1998, Accepted January 14, 2000.     

Total colorings of graphs of order 2n having maximum degree 2n−2

Let χ _t (G) and †(G) denote respectively the total chromatic number and maximum degree of graphG. Yap, Wang and Zhang proved in 1989 that ifG is a graph of orderp having †(G)≥p−4, then χ _t (G≤Δ(G)+2. Hilton has characterized the class of graphG of order 2n having †(G)=2n−1 such that χ _t (G=Δ(G)+2. In this paper, we characterize the class of graphsG of order 2n having †(G)=2n−2 such that χ _t (G=Δ(G)+2 Research supported by National Science Council of the Republic of China (NSC 79-0208-M009-15)     

Cycles in Partially Square Graphs

. In this work we consider finite undirected simple graphs. If G=(V,E) is a graph we denote by α(G) the stability number of G. For any vertex x let N[x] be the union of x and the neighborhood N(x). For each pair of vertices ab of G we associate the set J(a,b) as follows. J(a,b)={u∈N[a]∩N[b]∣N(u)⊆N[a]∪N[b]}. Given a graph G, its partially squareG ^* is the graph obtained by adding an edge uv for each pair u,v of vertices of G at distance 2 whenever J(u,v) is not empty. In the case G is a claw-free graph, G ^* is equal to G ². If G is k-connected, we cover the vertices of G by at most ⌈α(G ^*)/k⌉ cycles, where α(G ^*) is the stability number of the partially square graph of G. On the other hand we consider in G ^* conditions on the sum of the degrees. Let G be any 2-connected graph and t be any integer (t≥2). If ∑ _{x ∈ S} deg _G (x)≥|G|, for every t-stable set S⊆V(G) of G ^* then the vertex set of G can be covered with t−1 cycles. Different corollaries on covering by paths are given. Received: January 22, 1997 Final version received: February 15, 2000     

On a Function Related to Multinomial Coefficients (I)

Let F _p,t (n) denote the number of the coefficients of (x ₁+1x ₂+...+x _t ) ^j , 0 ≤j≤n− 1, which are not divisible by the prime p. Define G _p,t (n) = F _p,t /n ^θ and β(p,t) = lim infF _p,t )(n)/n ^θ, where θ = (log)/(log p). In this paper, we mainly prove that G _p,t can be extended to a continuous function on ℝ⁺, and the function G _p,t is nowhere monotonic. Both the set of differential points of the function G _p,t and the set of non-differential points of the function G _p,t are dense in ℝ⁺. Received February 18, 2000, Accepted December 7, 2000     

Super Connectivity of Line Graphs and Digraphs

The h-super connectivity κh and the h-super edge-connectivity λh are more refined network reliability indices than the conneetivity and the edge-connectivity. This paper shows that for a connected balanced digraph D and its line digraph L, if D is optimally super edge-connected, then κ1（L） = 2λ1 （D）, and that for a connected graph G and its line graph L, if one of κ1 （L） and λ（G） exists, then κ1（L） = λ2（G）. This paper determines that κ1（B（d, n） is equal to 4d- 8 for n = 2 and d ≥ 4, and to 4d-4 for n ≥ 3 and d ≥ 3, and that κ1（K（d, n）） is equal to 4d- 4 for d 〉 2 and n ≥ 2 except K（2, 2）. It then follows that B（d,n） and K（d, n） are both super connected for any d ≥ 2 and n ≥ 1.     

A Neighborhood Condition for Graphs to Have [a, b]-Factors II

 Let a, b, m, and t be integers such that 1≤a<b and 1≤t≤⌉(b−m+1)/a⌉. Suppose that G is a graph of order |G| and H is any subgraph of G with the size |E(H)|=m. Then we prove that G has an [a,b]-factor containing all the edges of H if the minimum degree is at least a, |G|>((a+b)(t(a+b−1)−1)+2m)/b, and |N _G (x ₁)∪⋯ ∪N _G (x _t )|≥(a|G|+2m)/(a+b) for every independent set {x ₁,…,x _t }⊆V(G). This result is best possible in some sense and it is an extension of the result of H. Matsuda (A neighborhood condition for graphs to have [a,b]-factors, Discrete Mathematics 224 (2000) 289–292). Received: October, 2001 Final version received: September 17, 2002 RID="*" ID="*" This research was partially supported by the Ministry of Education, Science, Sports and Culture, Grant-in-Aid for Encouragement of Young Scientists, 13740084, 2001