Decomposition of balanced complete bipartite multigraphs into multistars

In this paper, we obtain a criterion for the decomposition of the λ-fold balanced complete bipartite multigraph λK_n,n into (not necessarily isomorphic) multistars with the same number of edges. We also give a necessary and sufficient condition of decomposing 2K_n,n into isomorphic multistars.     

Divergence points of self-similar measures satisfying the OSC

Recently, Barreira and Schmeling (2000) [1] and Chen and Xiong (1999) [2] have shown, that for self-similar measures satisfying the SSC the set of divergence points typically has the same Hausdorff dimension as the support K. It is natural to ask whether we obtain a similar result for self-similar measures satisfying the OSC. However, with only the OSC satisfied, we cannot do most of the work on a symbolic space and then transfer the results to the subsets of Rd, which makes things more difficult. In this paper, by the box-counting principle we show that the set of divergence points has still the same Hausdorff dimension as the support K for self-similar measures satisfying the OSC.     

Rayleigh dissipation from the general recurrence of metrics in path spaces

Given a pair (metric g, symmetric 2-covariant tensor field H though as a Rayleigh dissipation) on a path space (manifold M, semispray S), the family of nonlinear connections N such that H equals the dynamical derivative of g with respect to (S,N) is determined by using the Obata tensors. In this way, we generalize the case of metric nonlinear connections as well as that of recurrent metrics. As applications, we treat firstly the case of Finslerian (α,β)-metrics finding all nonlinear connections for which the associated Finsler-Sasaki metric is exactly the dynamical derivative of the Riemannian-Sasaki metric. Secondly, we apply our results for the case of Beil metrics used in Relativity and field theories.     

Identities for the Widder transform and transforms with Bessel function kernels

In the present paper, we consider the classical Widder transform, the H_ν-transform, the K_ν-transform, and the Y_ν-transform. Some identities involving these transforms and many others are given. By making use of these identities, a number of new Parseval-Goldstein type identities are obtained for these and other well-known integral transforms.     

Property (w) and perturbations II

This note is a continuation of a previous article [P. Aiena, M.T. Biondi, Property (w) and perturbations, J. Math. Anal. Appl. 336 (2007) 683-692] concerning the stability of property (w), a variant of Weyl's theorem, for a bounded operator T acting on a Banach space, under finite-dimensional perturbations K commuting with T. A counterexample shows that property (w) in general is not preserved under finite-dimensional perturbations commuting with T, also under the assumption that T is a-isoloid.     

The Independence Number for De Bruijn networks and Kautz networks

Let D be a directed graph; the (l,ω)-Independence Number of graph D, denoted by α_l,ω(D), is an important performance parameter for interconnection networks. De Bruijn networks and Kautz networks, denoted by B(d,n) and K(d,n) respectively, are versatile and efficient topological structures of interconnection networks. For l=1,2,…,n, this paper shows that α_l,d−1(B(d,n))=dⁿ,α_l,d−1(K(d,n))=α_l,d(K(d,n))=dⁿ+dⁿ⁻¹ if d≥3 and n≤d−2. In particular, the paper shows the exact value of the Independence Number for B(d,1) and B(d,2) for any d. For the generalized situation, the paper obtains a lower bound α_l,d−1(B(d,n))≥d² if n≥3 and d≥5.     

The intersection of essential approximate point spectra of operator matrices

When A∈B(H) and B∈B(K) are given, we denote by MC the operator acting on the infinite-dimensional separable Hilbert space H⊕K of the form . In this paper, it is shown that there exists some operator C∈B(K,H) such that MC is upper semi-Fredholm and ind(MC)?0 if and only if there exists some left invertible operator C∈B(K,H) such that MC is upper semi-Fredholm and ind(MC)?0. A necessary and sufficient condition for MC to be upper semi-Fredholm and ind(MC)?0 for some C∈Inv(K,H) is given, where Inv(K,H) denotes the set of all the invertible operators of B(K,H). In addition, we give a necessary and sufficient condition for MC to be upper semi-Fredholm and ind(MC)?0 for all C∈Inv(K,H).     

The clique operator on circular-arc graphs

A circular-arc graphG is the intersection graph of a collection of arcs on the circle and such a collection is called a model of G. Say that the model is proper when no arc of the collection contains another one, it is Helly when the arcs satisfy the Helly Property, while the model is proper Helly when it is simultaneously proper and Helly. A graph admitting a Helly (resp. proper Helly) model is called a Helly (resp. proper Helly) circular-arc graph. The clique graphK(G) of a graph G is the intersection graph of its cliques. The iterated clique graphKⁱ(G) of G is defined by K⁰(G)=G and Kⁱ⁺¹(G)=K(Kⁱ(G)). In this paper, we consider two problems on clique graphs of circular-arc graphs. The first is to characterize clique graphs of Helly circular-arc graphs and proper Helly circular-arc graphs. The second is to characterize the graph to which a general circular-arc graph K-converges, if it is K-convergent. We propose complete solutions to both problems, extending the partial results known so far. The methods lead to linear time recognition algorithms, for both problems.     

Triangular line graphs and word sense disambiguation

Linguists often represent the relationships between words in a collection of text as an undirected graph G=(V,E), where V is the vocabulary and vertices are adjacent in G if and only if the words that they represent co-occur in a relevant pattern in the text. Ideally, the words with similar meanings give rise to the vertices of a component of the graph. However, many words have several distinct meanings, preventing components from characterizing distinct semantic fields. This paper examines how the structural properties of triangular line graphs motivate the use of a clustering coefficient on the triangular line graph, thereby helping to identify polysemous words. The triangular line graph of G, denoted by T(G), is the subgraph of the line graph of G where two vertices are adjacent if the corresponding edges in G belong to a K₃.     

Remark on uniqueness of mild solutions to the Navier-Stokes equations

We investigate a limiting uniqueness criterion to the Navier-Stokes equations. We prove that the mild solution is unique under the class , where bmo^-1 is the “critical” space including Lⁿ. As an application of uniqueness theorem, we also consider the local well-posedness of Navier-Stokes equations in bmo^-1.     

Completing an extension of Tunnell's theorem

We look at a special case of a familiar problem: Given a locally compact group G, a subgroup H and a complex representation π₊ of G how does π₊ decompose on restriction to H. Here G is GL⁺(2,F), where F is a nonarchimedian local field of characteristic not two, K a separable quadratic extension of F, GL⁺(2,F) the subgroup of index 2 in GL(2,F) consisting of those matrices whose determinant is in NK/F(K^∗), π₊ is an irreducible, admissible supercuspidal representation of GL⁺(2,F) and H=K^∗ under an embedding of K^∗ into GL(2,F).     

The range of united K-theory

We prove that the united K-theory functor is a surjective functor from the category of real simple separable purely infinite C^∗-algebras to the category of countable acyclic CRT-modules. As a consequence, we show that every complex Kirchberg algebra satisfying the universal coefficient theorem is the complexification of a real C^∗-algebra.     

On (s,t)-supereulerian graphs in locally highly connected graphs

Given two nonnegative integers s and t, a graph G is (s,t)-supereulerian if for any disjoint sets X,Y⊂E(G) with |X|≤s and |Y|≤t, there is a spanning eulerian subgraph H of G that contains X and avoids Y. We prove that if G is connected and locally k-edge-connected, then G is (s,t)-supereulerian, for any pair of nonnegative integers s and t with s+t≤k−1. We further show that if s+t≤k and G is a connected, locally k-edge-connected graph, then for any disjoint sets X,Y⊂E(G) with |X|≤s and |Y≤t, there is a spanning eulerian subgraph H that contains X and avoids Y, if and only if G−Y is not contractible to K₂ or to K_2,l with l odd.     

Non-simultaneous blow-up and blow-up rates for reaction-diffusion equations

This paper considers blow-up solutions for reaction-diffusion equations, complemented by homogeneous Dirichlet boundary conditions. It is proved that there exist initial data such that one block or two (separated or contiguous) blocks of n components blow up simultaneously while the others remain bounded. As a corollary, a necessary and sufficient condition is obtained such that any blow-up must be the case for at least two components blowing up simultaneously. We also show some other exponent regions, where any blow-up of k(∈{1,2,…,n}) components must be simultaneous. Moreover, the corresponding blow-up rates and sets are discussed. The results extend those in Liu and Li [B.C. Liu, F.J. Li, Non-simultaneous blow-up of n components for nonlinear parabolic systems, J. Math. Anal. Appl. 356 (2009) 215-231].     

Soliton solutions of a BBM(m, n) equation with generalized evolution

We consider a BBM(m, n) equation which is a generalization of the celebrated Benjamin-Bona-Mahony equation with generalized evolution term. By using two solitary wave ansatze in terms of sech^p(x) and tanh^p(x) functions, we find exact analytical bright and dark soliton solutions for the considered model. The physical parameters in the soliton solutions are obtained as function of the dependent model coefficients. The conditions of existence of solitons are presented. Note that, it is always useful and desirable to construct exact analytical solutions especially soliton-type envelope for the understanding of most nonlinear physical phenomena.     

Optimization and sensitivity analysis of controlling arrivals in the queueing system with single working vacation

This paper analyzes the F-policy M/M/1/K queueing system with working vacation and an exponential startup time. The F-policy deals with the issue of controlling arrivals to a queueing system, and the server requires a startup time before allowing customers to enter the system. For the queueing systems with working vacation, the server can still provide service to customers rather than completely stop the service during a vacation period. The matrix-analytic method is applied to develop the steady-state probabilities, and then obtain several system characteristics. We construct the expected cost function and formulate an optimization problem to find the minimum cost. The direct search method and Quasi-Newton method are implemented to determine the optimal system capacity K, the optimal threshold F and the optimal service rates (μ_B,μ_V) at the minimum cost. A sensitivity analysis is conducted to investigate the effect of changes in the system parameters on the expected cost function. Finally, numerical examples are provided for illustration purpose.     

Distance-two labellings of Hamming graphs

Let j≥k≥0 be integers. An ?-L(j,k)-labelling of a graph G=(V,E) is a mapping ?:V→{0,1,2,…,?} such that |?(u)−?(v)|≥j if u,v are adjacent and |?(u)−?(v)|≥k if they are distance two apart. Let λ_j,k(G) be the smallest integer ? such that G admits an ?-L(j,k)-labelling. Define to be the smallest ? if G admits an ?-L(j,k)-labelling with ?(V)={0,1,2,…,?} and ∞ otherwise. An ?-cyclic L(j,k)-labelling is a mapping ?:V→Z_? such that |?(u)−?(v)|_?≥j if u,v are adjacent and |?(u)−?(v)|_?≥k if they are distance two apart, where |x|_?=min{x,?−x} for x between 0 and ?. Let σ_j,k(G) be the smallest ?−1 of such a labelling, and define similarly to . We determine λ_2,0, , σ_2,0 and for all Hamming graphs K_q1□K_q2□?□K_qd (d≥2, q₁≥q₂≥?≥q_d≥2) and give optimal labellings, with the only exception being for q≥4. We also prove the following “sandwich theorem”: If q₁ is sufficiently large then for any graph G between K_q1□K_q2 and K_q1□K_q2□?□K_qd, and moreover we give a labelling which is optimal for these eight invariants simultaneously.     

Turán's theorem for pseudo-random graphs

The generalized Turán number ex(G,H) of two graphs G and H is the maximum number of edges in a subgraph of G not containing H. When G is the complete graph Km on m vertices, the value of ex(Km,H) is , where o(1)→0 as m→∞, by the Erd?s-Stone-Simonovits theorem.In this paper we give an analogous result for triangle-free graphs H and pseudo-random graphs G. Our concept of pseudo-randomness is inspired by the jumbled graphs introduced by Thomason [A. Thomason, Pseudorandom graphs, in: Random Graphs '85, Poznań, 1985, North-Holland, Amsterdam, 1987, pp. 307-331. MR 89d:05158]. A graph G is (q,β)-bi-jumbled if

     

Atom-bond connectivity index of graphs

The recently introduced atom-bond connectivity (ABC) index has been applied up until now to study the stability of alkanes and the strain energy of cycloalkanes. Furtula et al. (2009) [3] obtained extremal ABC values for chemical trees, and also, it has been shown that the star K_1,n−1, has the maximal ABC value of trees. In this paper, we present the lower and upper bounds on ABC index of graphs and trees, and characterize graphs for which these bounds are best possible.