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     

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)     

Locally boundedly A‐p‐convex algebras

We consider locally p‐convex algebras the bornologies of which coincide with the ones of p‐normed or multiplicatively p‐convex topologies. Two new classes of these algebras are introduced here. (© 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.     

Mass‐in‐mass lattices with small internal resonators

We consider the mass‐in‐mass (MiM) lattice when the internal resonators are very small. When there are no internal resonators the lattice reduces to a standard Fermi‐Pasta‐Ulam‐Tsingou (FPUT) system. We show that the solution of the MiM system, with suitable initial data, shadows the FPUT system for long periods of time. Using some classical oscillatory integral estimates we can conclude that the error of the approximation is (in some settings) higher than one may expect.     

Minimally (k,k)‐edge‐connected graphs

For an integer l > 1, the l‐edge‐connectivity of a connected graph with at least l vertices is the smallest number of edges whose removal results in a graph with l components. A connected graph G is (k, l)‐edge‐connected if the l‐edge‐connectivity of G is at least k. In this paper, we present a structural characterization of minimally (k, k)‐edge‐connected graphs. As a result, former characterizations of minimally (2, 2)‐edge‐connected graphs in [J of Graph Theory 3 (1979), 15–22] are extended. © 2003 Wiley Periodicals, Inc. J Graph Theory 44: 116–131, 2003     

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.     

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.     

New ‐Edge‐Balanced Graphs from Bipartite Graphs

Let G be a graph of order n satisfying that there exists for which every graph of order n and size t is contained in exactly λ distinct subgraphs of the complete graph isomorphic to G. Then G is called t‐edge‐balanced and λ the index of G. In this article, new examples of 2‐edge‐balanced graphs are constructed from bipartite graphs and some further methods are introduced to obtain more from old.     

Nowhere‐zero 3‐flows in locally connected graphs

Let G be a graph. For each vertex v ∈V(G), N_v denotes the subgraph induces by the vertices adjacent to v in G. The graph G is locally k‐edge‐connected if for each vertex v ∈V(G), N_v is k‐edge‐connected. In this paper we study the existence of nowhere‐zero 3‐flows in locally k‐edge‐connected graphs. In particular, we show that every 2‐edge‐connected, locally 3‐edge‐connected graph admits a nowhere‐zero 3‐flow. This result is best possible in the sense that there exists an infinite family of 2‐edge‐connected, locally 2‐edge‐connected graphs each of which does not have a 3‐NZF. © 2003 Wiley Periodicals, Inc. J Graph Theory 42: 211–219, 2003     

A fluid‐fluid interaction method using decoupled subproblems and differing time steps

A time stepping procedure is proposed for a coupled fluid model motivated by the dynamic core of the atmosphere‐ocean system. The method exploits properties of the atmosphere‐ocean system to obtain efficiency. The momentum equations for the two fluids may be solved in parallel with different time step sizes. Stability is maintained with large time steps via a balanced two‐way passing of momentum flux. Numerical tests are provided that demonstrate the efficiency of the method. Published 2011 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2012     

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.     

The persistent‐access‐caching algorithm

Caching is widely recognized as an effective mechanism for improving the performance of the World Wide Web. One of the key components in engineering the Web caching systems is designing document placement/replacement algorithms for updating the collection of cached documents. The main design objectives of such a policy are the high cache hit ratio, ease of implementation, low complexity and adaptability to the fluctuations in access patterns. These objectives are essentially satisfied by the widely used heuristic called the least‐recently‐used (LRU) cache replacement rule. However, in the context of the independent reference model, the LRU policy can significantly underperform the optimal least‐frequently‐used (LFU) algorithm that, on the other hand, has higher implementation complexity and lower adaptability to changes in access frequencies. To alleviate this problem, we introduce a new LRU‐based rule, termed the persistent‐access‐caching (PAC), which essentially preserves all of the desirable attributes of the LRU scheme. For this new heuristic, under the independent reference model and generalized Zipf's law request probabilities, we prove that, for large cache sizes, its performance is arbitrarily close to the optimal LFU algorithm. Furthermore, this near‐optimality of the PAC algorithm is achieved at the expense of a negligible additional complexity for large cache sizes when compared to the ordinary LRU policy, since the PAC algorithm makes the replacement decisions based on the references collected during the preceding interval of fixed length. © 2008 Wiley Periodicals, Inc. Random Struct. Alg., 2008     

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     

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.     

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.     

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.