Stability of the fractional Volterra integro‐differential equation by means of ψ‐Hilfer operator

In this paper, using the Riemann‐Liouville fractional integral with respect to another function and the ψ?Hilfer fractional derivative, we propose a fractional Volterra integral equation and the fractional Volterra integro‐differential equation. In this sense, for this new fractional Volterra integro‐differential equation, we study the Ulam‐Hyers stability and, also, the fractional Volterra integral equation in the Banach space, by means of the Banach fixed‐point theorem. As an application, we present the Ulam‐Hyers stability using the α‐resolvent operator in the Sobolev space .     

S‐essential spectra and application to an example of transport operators

In this article, we give some results on the S‐essential spectra of a linear operator defined on a Banach space. Furthermore, we apply the obtained results to determine the S‐essential spectra of an integro‐differential operator with abstract boundary conditions in the Banach space L_p([?a,a] × [?1,1]),p ≥ 1 and a > 0. Copyright © 2012 John Wiley & Sons, Ltd.     

Well‐posedness of time‐space fractional stochastic evolution equations driven by α‐stable noise

This paper is devoted to the well‐posedness for time‐space fractional Ginzburg‐Landau equation and time‐space fractional Navier‐Stokes equations by α‐stable noise. The spatial regularity and the temporal regularity of the nonlocal stochastic convolution are firstly established, and then the existence and uniqueness of the global mild solution are obtained by the Banach fixed point theorem and Mittag‐Leffler functions, respectively. Numerical simulations for time‐space fractional Ginzburg‐Landau equation are provided to verify the analysis results.     

S‐asymptotically ω‐periodic solutions for semilinear Volterra equations

We study S‐asymptotically ω‐periodic mild solutions of the semilinear Volterra equation u′(t)=(a* Au)(t)+f(t, u(t)), considered in a Banach space X, where A is the generator of an (exponentially) stable resolvent family. In particular, we extend the recent results for semilinear fractional integro‐differential equations considered in (Appl. Math. Lett. 2009; 22:865–870) and for semilinear Cauchy problems of first order given in (J. Math. Anal. Appl. 2008; 343(2): 1119–1130). Applications to integral equations arising in viscoelasticity theory are shown. Copyright © 2010 John Wiley & Sons, Ltd.     

Existence of positive solutions of fractional‐order elastic beam equation with a non‐Carathéodory nonlinearity

In this article, the existence of positive solutions of a boundary value problem for nonlinear singular fractional‐order elastic beam equation is established. Here, f depends on t,x, and x′; f may be singular at t = 0 and t = 1; and f is a non‐Carathéodory function. The results obtained are based upon fixed‐point theorems in a cone in Banach space. An example is included to illustrate the main results. Copyright © 2015 John Wiley & Sons, Ltd.     

Extremal solutions for p‐Laplacian boundary value problems with the right‐handed Riemann‐Liouville fractional derivative

The paper is concerned with the solvability for several nonlinear boundary value problems of fractional p‐Laplacian differential equation involving the right‐handed Riemann‐Liouville derivative. By applying monotone iterative technique, lower and upper solutions method and the Banach fixed point theorem, sufficient conditions for existence and uniqueness of extremal solutions are obtained and they extend existing results. At last, two examples are provided to illustrate the results.     

Stability number and [a,b]‐factors in graphs

A spanning subgraph whose vertices have degrees belonging to the interval [a,b], where a and b are positive integers, such that a ≤ b, is called an [a,b]‐factor. In this paper, we prove sufficient conditions for existence of an [a,b]‐factor, a connected [a,b]‐factor, and a 2‐connected [a,b]‐factor. The conditions involve the minimum degree, the stability number, and the connectivity of a graph. © 2004 Wiley Periodicals, Inc. J Graph Theory 46: 254–264, 2004     

The existence of solutions for an impulsive fractional coupled system of (p,q)‐Laplacian type without the Ambrosetti‐Rabinowitz condition

In this article, based on the variational approach, the existence of at least one nontrivial solution is studied for (p, q)‐Laplacian type impulsive fractional differential equations involving Riemann‐Liouville derivatives. Without the usual Ambrosetti‐Rabinowitz condition, the nonlinearity f in the paper is considered under some suitable assumptions.     

Fractional powers of the noncommutative Fourier's law by the S‐spectrum approach

Let e_?, for ? = 1,2,3, be orthogonal unit vectors in and let be a bounded open set with smooth boundary ?Ω. Denoting by a point in Ω, the heat equation, for nonhomogeneous materials, is obtained replacing the Fourier law, given by the following: into the conservation of energy law, here a, b, are given functions. With the S‐spectrum approach to fractional diffusion processes we determine, in a suitable way, the fractional powers of T. Then, roughly speaking, we replace the fractional powers of T into the conservation of energy law to obtain the fractional evolution equation. This method is important for nonhomogeneous materials where the Fourier law is not simply the negative gradient. In this paper, we determine under which conditions on the coefficients a, b, the fractional powers of T exist in the sense of the S‐spectrum approach. More in general, this theory allows to compute the fractional powers of vector operators that arise in different fields of science and technology. This paper is devoted to researchers working in fractional diffusion and fractional evolution problems, partial differential equations, and noncommutative operator theory.     

{2, 3}‐perfect m‐cycle systems are equationally defined for m = 5, 7, 8, 9, and 11 only

An m‐cycle system (S,C) of order n is said to be {2,3}‐perfect provided each pair of vertices is connected by a path of length 2 in an m‐cycle of C and a path of length 3 in an m‐cycle of C. The class of {2,3}‐perfect m‐cycle systems is said to be equationally defined provided, there exists a variety of quasigroups V with the property that a finite quasigroup (Q, , \, /) belongs to V if and only if its multiplicative (Q, ) part can be constructed from a {2,3}‐perfect m‐cycle system using the 2‐construction (a a = a for all a ∈ Q and if a ≠ b, a b = c and b a = d if and only if the m‐cycle (…, d, x, a, b, y, c, …) ∈ C). The object of this paper is to show that the class of {2,3}‐perfect m‐cycle systems cannot be equationally defined for all m ≥ 10, m ≠ 11. This combined with previous results shows that {2, 3}‐perfect m‐cycle systems are equationally defined for m = 5, 7, 8, 9, and 11 only. © 2004 Wiley Periodicals, Inc.     

A note on the first‐order logic of complete BL‐chains

In [10] it is claimed that the set of predicate tautologies of all complete BL‐chains and the set of all standard tautologies (i. e., the set of predicate formulas valid in all standard BL‐algebras) coincide. As noticed in [11], this claim is wrong. In this paper we show that a complete BL‐chain B satisfies all standard BL‐tautologies iff for any transfinite sequence (a_i: i ∈ I) of elements of B , the condition ∧_{i ∈ I} (a²_i ) = (∧_{i ∈ I} a_i)² holds in B . (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Functional impulsive differential equation of order α∈(1,2) with nonlocal initial and integral boundary conditions

The main work is related to show the existence and uniqueness of solution for the fractional impulsive differential equation of order α∈(1,2) with an integral boundary condition and finite delay. Using the application of the Banach and Sadovaskii fixed‐point theorems, we obtain the main results. An example is presented at the end to verify the results of the paper. Copyright © 2016 John Wiley & Sons, Ltd.     

Acyclic edge coloring of 2‐degenerate graphs

An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and is denoted by a′(G). A graph is called 2‐degenerate if any of its induced subgraph has a vertex of degree at most 2. The class of 2‐degenerate graphs properly contains series–parallel graphs, outerplanar graphs, non ? regular subcubic graphs, planar graphs of girth at least 6 and circle graphs of girth at least 5 as subclasses. It was conjectured by Alon, Sudakov and Zaks (and much earlier by Fiamcik) that a′(G)?Δ + 2, where Δ = Δ(G) denotes the maximum degree of the graph. We prove the conjecture for 2‐degenerate graphs. In fact we prove a stronger bound: we prove that if G is a 2‐degenerate graph with maximum degree Δ, then a′(G)?Δ + 1. © 2010 Wiley Periodicals, Inc. J Graph Theory 69: 1–27, 2012     

Some results on λ‐designs with two block sizes

A λ‐design is a family ?? = {B₁, B₂, …, B_v} of subsets of X = {1, 2, …, v} such that |B_i∩B_j| = λ for all i≠jand not all B_i are of the same size. The only known example of λ‐designs (called type‐1 designs) are those obtained from symmetric designs by a certain complementation procedure. Ryser [J Algebra 10 (1968), 246–261] and Woodall [Proc London Math Soc 20 (1970), 669–687] independently conjectured that all λ‐designs are type‐1. Let g = gcd(r ? 1, r^* ? 1), where rand r^* are the two replication numbers. Ionin and Shrikhande [J Combin Comput 22 (1996), 135–142; J Combin Theory Ser A 74 (1996), 100–114] showed that λ‐designs with g = 1, 2, 3, 4 are type‐1 and that the Ryser–Woodall conjecture is true for λ‐designs on p + 1, 2p + 1, 3p + 1, 4p + 1 points, where pis a prime. Hein and Ionin [Codes and Designs—Proceedings of Conference honoring Prof. D. K. Ray‐Chaudhuri on the occasion of his 65th birthday, Ohio State University Mathematical Research Institute Publications, 10, Walter de Gruyter, Berlin, 2002, pp. 145–156] proved corresponding results for g = 5 and Fiala [Codes and Designs—Proceedings of Conference honoring Prof. D. K. Ray‐Chaudhuri on the occasion of his 65th birthday, Ohio State University Mathematical Research Institute Publications, 10, Walter de Gruyter, Berlin, 2002, pp. 109–124; Ars Combin 68 (2003), 17–32; Ars Combin, to appear] for g = 6, 7, and 8. In this article, we consider λ designs with exactly two block sizes. We show that in this case, the conjecture is true for g = 9, 11, 12, 13, 15, 16, 17, 19, 20, 21, and for g = 10, 14, 18, 22 with v≠4λ ? 1. We also give two results on such λ‐designs on v = 9p + 1 and 12p + 1 points, where pis a prime. © 2010 Wiley Periodicals, Inc. J Combin Designs 19:95‐110, 2011     

The alternative Daugavet property of C *‐algebras and JB *‐triples

A Banach space X is said to have the alternative Daugavet property if for every (bounded and linear) rank‐one operator T: X → X there exists a modulus one scalar ω such that ∥Id+ωT ∥ = 1 + ∥T ∥. We give geometric characterizations of this property in the setting of C *‐algebras, JB *‐triples, and of their isometric preduals. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

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     

Some 3‐connected 4‐edge‐critical non‐Hamiltonian graphs

Let γ(G) be the domination number of graph G, thus a graph G is k‐edge‐critical if γ (G) = k, and for every nonadjacent pair of vertices u and υ, γ(G + uυ) = k?1. In Chapter 16 of the book “Domination in Graphs—Advanced Topics,” D. Sumner cites a conjecture of E. Wojcicka under the form “3‐connected 4‐critical graphs are Hamiltonian and perhaps, in general (i.e., for any k ≥ 4), (k?1)‐connected, k‐edge‐critical graphs are Hamiltonian.” In this paper, we prove that the conjecture is not true for k = 4 by constructing a class of 3‐connected 4‐edge‐critical non‐Hamiltonian graphs. © 2005 Wiley Periodicals, Inc.     

Uniform domain representations of ℓp ‐spaces

The category of Scott‐domains gives a computability theory for possibly uncountable topological spaces, via representations. In particular, every separable Banach‐space is representable over a separable domain. A large class of topological spaces, including all Banach‐spaces, is representable by domains, and in domain theory, there is a well‐understood notion of parametrizations over a domain. We explore the link with parameter‐dependent collections of spaces in e. g. functional analysis through a case study of ?^p ‐spaces. We show that a well‐known domain representation of ?^p as a metric space can be made uniform in the sense of parametrizations of domains. The uniform representations admit lifting of continuous functions and are effective in p. Dependent type constructions apply, and through the study of the sum and product spaces, we clarify the notions of uniformity and uniform computability. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Ricci η‐recurrent real hypersurfaces in 2‐dimensional nonflat complex space forms

Let M be a Hopf hypersurface in a nonflat complex space form $M^2(c)$, $c\ne 0$, of complex dimension two. In this paper, we prove that M has η‐recurrent Ricci operator if and only if it is locally congruent to a homogeneous real hypersurface of type (A) or (B) or a non‐homogeneous real hypersurface with vanishing Hopf principal curvature. This is an extension of main results in [17, 21] for real hypersurfaces of dimension three. By means of this result, we give some new characterizations of Hopf hypersurfaces of type (A) and (B) which generalize those in [14, 18, 26].     

On perfect Γ‐decompositions of the complete graph

Generalizing the well‐known concept of an i‐perfect cycle system, Pasotti [Pasotti, in press, Australas J Combin] defined a Γ‐decomposition (Γ‐factorization) of a complete graph K_v to be i‐perfect if for every edge [x, y] of K_v there is exactly one block of the decomposition (factor of the factorization) in which x and y have distance i. In particular, a Γ‐decomposition (Γ‐factorization) of K_v that is i‐perfect for any i not exceeding the diameter of a connected graph Γ will be said a Steiner (Kirkman) Γ‐system of order v. In this article we first observe that as a consequence of the deep theory on decompositions of edge‐colored graphs developed by Lamken and Wilson [Lamken and Wilson, 2000, J Combin Theory Ser A 89, 149–200], there are infinitely many values of v for which there exists an i‐perfect Γ‐decomposition of K_v provided that Γ is an i‐equidistance graph, namely a graph such that the number of pairs of vertices at distance i is equal to the number of its edges. Then we give some concrete direct constructions for elementary abelian Steiner Γ‐systems with Γ the wheel on 8 vertices or a circulant graph, and for elementary abelian 2‐perfect cube‐factorizations. We also present some recursive constructions and some results on 2‐transitive Kirkman Γ‐systems. © 2008 Wiley Periodicals, Inc. J Combin Designs 17: 197–209, 2009