Spaces of Bessel‐potential type and embeddings: the super‐limiting case

We consider Bessel‐potential spaces modelled upon Lorentz‐Karamata spaces and establish embedding theorems in the super‐limiting case. In addition, we refine a result due to Triebel, in the context of Bessel‐potential spaces, itself an improvement of the Brézis‐Wainger result (super‐limiting case) about the “almost Lipschitz continuity” of elements of H^1+n/p_p (?ⁿ). These results improve and extend results due to Edmunds, Gurka and Opic in the context of logarithmic Bessel potential spaces. We also give examples of embeddings of Besselpotential type spaces which are not of logarithmic type. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

3‐colorability of 4‐regular hamiltonian graphs

On the model of the cycle‐plus‐triangles theorem, we consider the problem of 3‐colorability of those 4‐regular hamiltonian graphs for which the components of the edge‐complement of a given hamiltonian cycle are non‐selfcrossing cycles of constant length ≥ 4. We show that this problem is NP‐complete. © 2002 Wiley Periodicals, Inc. J Graph Theory 42: 125–140, 2003     

Clique‐coloring some classes of odd‐hole‐free graphs

We consider the problem of clique‐coloring, that is coloring the vertices of a given graph such that no maximal clique of size at least 2 is monocolored. Whereas we do not know any odd‐hole‐free graph that is not 3‐clique‐colorable, the existence of a constant C such that any perfect graph is C‐clique‐colorable is an open problem. In this paper we solve this problem for some subclasses of odd‐hole‐free graphs: those that are diamond‐free and those that are bull‐free. We also prove the NP‐completeness of 2‐clique‐coloring K₄‐free perfect graphs. © 2006 Wiley Periodicals, Inc. J Graph Theory 53: 233–249, 2006     

Numerical and asymptotic study of non‐axisymmetric magnetohydrodynamic boundary layer stagnation‐point flows

Both numerical and asymptotic analyses are performed to study the similarity solutions of three‐dimensional boundary‐layer viscous stagnation point flow in the presence of a uniform magnetic field. The three‐dimensional boundary‐layer is analyzed in a non‐axisymmetric stagnation point flow, in which the flow is developed because of influence of both applied magnetic field and external mainstream flow. Two approaches for the governing equations are employed: the Keller‐box numerical simulations solving full nonlinear coupled system and a corresponding linearized system that is obtained under a far‐field behavior and in the limit of large shear‐to‐strain‐rate parameter (λ). From these two approaches, the flow phenomena reveals a rich structure of new family of solutions for various values of the magnetic number and λ. The various results for the wall stresses and the displacement thicknesses are presented along with some velocity profiles in both directions. The analysis discovered that the flow separation occurs in the secondary flow direction in the absence of magnetic field, and the flow separation disappears when the applied magnetic field is increased. The flow field is divided into a near‐field (due to viscous forces) and far‐field (due to mainstream flows), and the velocity profiles form because of an interaction between two regions. The magnetic field plays an important role in reducing the thickness of the boundary‐layer. A physical explanation for all observed phenomena is discussed. Copyright © 2017 John Wiley & Sons, Ltd.     

Gliding motion of bacteria on power‐law slime

The present investigation deals with an undulating surface model for the motility of bacteria gliding on a layer of non‐Newtonian slime. The slime being the viscoelastic material is considered as a power‐law fluid. A hydrodynamical model of motility involving an undulating cell surface which transmits stresses through a layer of exuded slime to the substratum is examined. The non‐linear differential equation resulting from the balance of momentum and mass is solved numerically by a finite difference method with an iteration technique. The manner in which the various exponent values of the power‐law flow affect the structure of the boundary layer is delineated. A comparison is made of the power‐law fluid with the Newtonian fluid. For the power‐law fluid with respect to different power‐law exponent values, shear‐thinning and shear‐thickening effects can be observed, respectively. Copyright © 2004 John Wiley & Sons, Ltd.     

Complexity of clique‐coloring odd‐hole‐free graphs

In this paper we investigate the problem of clique‐coloring, which consists in coloring the vertices of a graph in such a way that no monochromatic maximal clique appears, and we focus on odd‐hole‐free graphs. On the one hand we do not know any odd‐hole‐free graph that is not 3‐clique‐colorable, but on the other hand it is NP‐hard to decide if they are 2‐clique‐colorable, and we do not know if there exists any bound k₀ such that they are all k₀ ‐clique‐colorable. First we will prove that (odd hole, codiamond)‐free graphs are 2‐clique‐colorable. Then we will demonstrate that the complexity of 2‐clique‐coloring odd‐hole‐free graphs is actually Σ₂ P‐complete. Finally we will study the complexity of deciding whether or not a graph and all its subgraphs are 2‐clique‐colorable. © 2009 Wiley Periodicals, Inc. J Graph Theory 62: 139–156, 2009     

New Infinite Families of 2‐Edge‐Balanced Graphs

A graph G of order n is called t‐edge‐balanced if G satisfies the property that there exists a positive λ for which every graph of order n and size t is contained in exactly λ distinct subgraphs of isomorphic to G. We call λ the index of G. In this article, we obtain new infinite families of 2‐edge‐balanced graphs.     

On some subclasses of P‐matrices

A matrix with positive row sums and all its off‐diagonal elements bounded above by their corresponding row averages is called a B‐matrix by J. M. Peña in References (SIAM J. Matrix Anal. Appl. 2001; 22 :1027–1037) and (Numer. Math. 2003; 95 :337–345). In this paper, it is generalized to more extended matrices—MB‐matrices, which is proved to be a subclass of the class of P‐matrices. Subsequently, we establish relationships between defined and some already known subclasses of P‐matrices (see, References SIAM J. Matrix Anal. Appl. 2000; 21 :67–78; Linear Algebra Appl. 2004; 393 :353–364; Linear Algebra Appl. 1995; 225 :117–123). As an application, some subclasses of P‐matrices are used to localize the real eigenvalues of a real matrix. Copyright © 2007 John Wiley & Sons, Ltd.     

Asymptotic results on the existence of 4‐RGDDs and uniform 5‐GDDs

In this paper, we continue to investigate the existence of 4‐RGDDs and uniform 5‐GDDs. It is proved that the necessary conditions for the existence of such designs are also sufficient with a finite number of possible exceptions. As an application, the known results on the existence of uniform 4‐frames are also improved. © 2004 Wiley Periodicals, Inc.     

Chromatic‐index‐critical graphs of even order

A k‐critical (multi‐) graph G has maximum degree k, chromatic index χ′(G) = k + 1, and χ′(G − e) < k + 1 for each edge e of G. For each k ≥ 3, we construct k‐critical (multi‐) graphs with certain properties to obtain counterexamples to some well‐known conjectures. © 1999 John Wiley & Sons, Inc. J Graph Theory 30: 27–36, 1999     

Algebraization of the Three‐valued BCK‐logic

In this paper a definition of n‐valued system in the context of the algebraizable logics is proposed. We define and study the variety V₃, showing that it is definitionally equivalent to the equivalent quasivariety semantics for the “Three‐valued BCK‐logic”. As a consequence we find an axiomatic definition of the above system.     

Complexity and stability of soliton management in periodically modulated and random systems

A brief introduction is given to the concept of the soliton management, i.e., stable motion of localized pulses in media with strong periodic (or, sometimes, random) inhomogeneity, or conditions for the survival of solitons in models with strong time‐periodic modulation of linear or nonlinear coefficients. It is demonstrated that a class of systems can be identified, in which solitons remain robust inherently coherent objects in seemingly “hostile” environments. Most physical models belonging to this class originate in nonlinear optics and Bose‐Einstein condensation, although other examples are known too (in particular, in hydrodynamics). In this paper, the complexity of the soliton‐management systems, and the robustness of solitons in them are illustrated using a recently explored fiber‐optic setting combining a periodic concatenation of nonlinear and dispersive segments (the split‐step model) for bimodal optical signals (i.e., ones with two polarizations of light), which includes the polarization mode dispersion, i.e., random linear mixing of the two polarization components at junctions between the fiber segment. © 2008 Wiley Periodicals, Inc. Complexity, 2008     

An Asymptotic Version of the Multigraph 1‐Factorization Conjecture

We give a self‐contained proof that for all positive integers r and all , there is an integer such that for all any regular multigraph of order 2n with multiplicity at most r and degree at least is 1‐factorizable. This generalizes results of Perkovi? and Reed (Discrete Math 165/166 (1997), 567–578) and Plantholt and Tipnis (J London Math Soc 44 (1991), 393–400).     

On the Existence of

Let there is an . For or , has been determined by Hanani, and for or , has been determined by the first author. In this paper, we investigate the case . A necessary condition for is . It is known that , and that there is an for all with a possible exception . We need to consider the case . It is proved that there is an for all with an exception and a possible exception , thereby, .     

Sufficient conditions for graphs to be λ′‐optimal,super‐edge‐connected,and maximally edge‐connected

The restricted‐edge‐connectivity of a graph G, denoted by λ′(G), is defined as the minimum cardinality over all edge‐cuts S of G, where G‐S contains no isolated vertices. The graph G is called λ′‐optimal, if λ′(G) = ξ(G), where ξ(G) is the minimum edge‐degree in G. A graph is super‐edge‐connected, if every minimum edge‐cut consists of edges adjacent to a vertex of minimum degree. In this paper, we present sufficient conditions for arbitrary, triangle‐free, and bipartite graphs to be λ′‐optimal, as well as conditions depending on the clique number. These conditions imply super‐edge‐connectivity, if δ (G) ≥ 3, and the equality of edge‐connectivity and minimum degree. Different examples will show that these conditions are best possible and independent of other results in this area. © 2005 Wiley Periodicals, Inc. J Graph Theory 48: 228–246, 2005     

Hamilton cycle and Hamilton path extendability of Cayley graphs on abelian groups

In this paper the concepts of Hamilton cycle (HC) and Hamilton path (HP) extendability are introduced. A connected graph Γ is n‐HC‐extendable if it contains a path of length n and if every such path is contained in some Hamilton cycle of Γ. Similarly, Γ is weakly n‐HP‐extendable if it contains a path of length n and if every such path is contained in some Hamilton path of Γ. Moreover, Γ is strongly n‐HP‐extendable if it contains a path of length n and if for every such path P there is a Hamilton path of Γ starting with P. These concepts are then studied for the class of connected Cayley graphs on abelian groups. It is proved that every connected Cayley graph on an abelian group of order at least three is 2‐HC‐extendable and a complete classification of 3‐HC‐extendable connected Cayley graphs of abelian groups is obtained. Moreover, it is proved that every connected Cayley graph on an abelian group of order at least five is weakly 4‐HP‐extendable. Copyright © 2011 Wiley Periodicals, Inc. J Graph Theory     

Self‐Dual Codes and the Nonexistence of a Quasi‐Symmetric 2‐(37,9,8) Design with Intersection Numbers 1 and 3

We prove that a certain binary linear code associated with the incidence matrix of a quasi‐symmetric 2‐(37, 9, 8) design with intersection numbers 1 and 3 must be contained in an extremal doubly even self‐dual code of length 40. Using the classification of extremal doubly even self‐dual codes of length 40, we show that a quasi‐symmetric 2‐(37, 9, 8) design with intersection numbers 1 and 3 does not exist.     

Local well‐posedness and blow‐up criteria of solutions for a rod equation

In this paper we consider a new rod equation derived recently by Dai [Acta Mech. 127 No. 1–4, 193–207 (1998)] for a compressible hyperelastic material. We establish local well‐posedness for regular initial data and explore various sufficient conditions of the initial data which guarantee the blow‐up in finite time both for periodic and non‐periodic case. Moreover, the blow‐up time and blow‐up rate are given explicitly. Some interesting examples are given also. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Solution of solute transport in unsaturated porous media by the method of characteristics

A degenerate convection‐diffusion problem is approximated using the scheme that is based on the relaxation method and also the method of characteristics. A mathematical model for solute transport in unsaturated porous media is included. Moreover, multiple site adsorption is considered. Convergence of the scheme is proved and numerical experiments in 1D and 2D are presented. © 2003 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 19: 732–761, 2003.     

On the asymptotics of fault probability in least‐recently‐used caching with Zipf‐type request distribution

We consider the least‐recently‐used cache replacement rule with a Zipf‐type page request distribution and investigate an asymptotic property of the fault probability with respect to an increase of cache size. We first derive the asymptotics of the fault probability for the independent‐request model and then extend this derivation to a general dependent‐request model, where our result shows that under some weak assumptions the fault probability is asymptotically invariant with regard to dependence in the page request process. In a previous study, a similar result was derived by applying a Poisson embedding technique, where a continuous‐time proof was given through some assumptions based on a continuous‐time modeling. The Poisson embedding, however, is just a technique used for the proof and the problem is essentially on a discrete‐time basis; thus, it is preferable to make assumptions, if any, directly in the discrete‐time setting. We consider a general dependent‐request model and give a direct discrete‐time proof under different assumptions. A key to the proof is that the numbers of requests for respective pages represent conditionally negatively associated random variables. © 2005 Wiley Periodicals, Inc. Random Struct. Alg., 2006