A survey of Nordhaus–Gaddum type relations

In 1956, Nordhaus and Gaddum gave lower and upper bounds on the sum and the product of the chromatic number of a graph and its complement, in terms of the order of the graph. Since then, relations of a similar type have been proposed for many other graph invariants, in several hundred papers. We present a survey on this research endeavor.     

Existence and uniqueness results for a semilinear Black–Scholes type equation

This paper deals with the application of fixed point theorem to determine the source term of semilinear Black–Scholes type equation and thereby establish the existence and uniqueness of the solution. The proof mainly relies on the iteration method and the Schauder fixed point theorem.     

Fejér and Hermite–Hadamard type results for H-invex functions with applications

Positivity - We investigate the class of H-invex functions including, e.g., the subclasses of convex, c-strongly convex, $$ \varphi $$ -uniformly convex and superquadratic functions. For H-invex...     

Nordhaus–Gaddum Results for the Induced Path Number of a Graph When Neither the Graph Nor Its Complement Contains Isolates

The induced path number \(\rho (G)\) of a graph G is defined as the minimum number of subsets into which the vertex set of G can be partitioned so that each subset induces a path. A product Nordhaus–Gaddum-type result is a bound on the product of a parameter of a graph and its complement. Hattingh et al. (Util Math 94:275–285, 2014) showed that if G is a graph of order n, then \(\lceil \frac{n}{4} \rceil \le \rho (G) \rho (\overline{G}) \le n \lceil \frac{n}{2} \rceil \), where these bounds are best possible. It was also noted that the upper bound is achieved when either G or \(\overline{G}\) is a graph consisting of n isolated vertices. In this paper, we determine best possible upper and lower bounds for \(\rho (G) \rho (\overline{G})\) when either both G and \(\overline{G}\) are connected or neither G nor \(\overline{G}\) has isolated vertices.     

Nordhaus–Gaddum-Type Theorem for Rainbow Connection Number of Graphs

An edge-colored graph G is rainbow connected if every two vertices of G are connected by a path whose edges have distinct colors. The rainbow connection number of G, denoted by rc(G), is the minimum number of colors that are needed to make G rainbow connected. In this paper we give a Nordhaus–Gaddum-type result for the rainbow connection number. We prove that if G and ${\overline{G}}$ are both connected, then ${4\leq rc(G)+rc(\overline{G})\leq n+2}$ . Examples are given to show that the upper bound is sharp for n ≥ 4, and the lower bound is sharp for n ≥ 8. Sharp lower bounds are also given for n = 4, 5, 6, 7, respectively.     

Existence results for evolutionary inclusions and variational–hemivariational inequalities

We consider an abstract first-order evolutionary inclusion in a reflexive Banach space. The inclusion contains the sum of L-pseudomonotone operator and a maximal monotone operator. We provide an existence theorem which is a generalization of former results known in the literature. Next, we apply our result to the case of nonlinear variational–hemivariational inequalities considered in the setting of an evolution triple of spaces. We specify the multivalued operators in the problem and obtain existence results for several classes of variational–hemivariational inequality problems. Finally, we illustrate our existence result and treat a class of quasilinear parabolic problems under nonmonotone and multivalued flux boundary conditions.     

Some Ramsey-Turán type results for hypergraphs

To everyk-graphG let(G) be the minimal real number such that for every>0 andn>n ₀(,G) everyk-graphH withn vertices and more than (+) ( ) edges contains a copy ofG. The real number (G) is defined in the same way adding the constraint that all independent sets of vertices inH have sizeo(n). Answering a problem of Erds and Sós it is shown that there exist infinitely manyk-graphs with 0<(G)<(G) for everyk3. It is worth noting that we were unable to find a singleG with the above property.This paper was written while the authors were visiting AT&T Bell Laboratories, Murray Hill, NJ 07974.     

Marcinkiewicz–Zygmund type results in multivariate domains

We investigate Marcinkiewicz–Zygmund type inequalities for multivariate polynomials on various compact domains in \({\mathbb{R}^d}\). These inequalities provide a basic tool for the discretization of the L ^p norm and are widely used in the study of the convergence properties of Fourier series, interpolation processes and orthogonal expansions. Recently Marcinkiewicz–Zygmund type inequalities were verified for univariate polynomials for the general class of doubling weights, and for multivariate polynomials on the ball and sphere with doubling weights. The main goal of the present paper is to extend these considerations to more general multidimensional domains, which in particular include polytopes, cones, spherical sectors, toruses, etc. Our approach will rely on application of various polynomial inequalities, such as Bernstein–Markov, Schur and Videnskii type estimates, and also using symmetry and rotation in order to generate results on new domains.     

Phragmén–Lindelöf alternative and continuous dependence-type results for the thermoelasticity of type III

In this article, equations of thermoelasticity of type III in three-dimensional cylindrical domain are studied. We prove a Phragmén–Lindelöf alternative result, i.e. the smooth solutions either grow or decay exponentially as the distance from the entry section tends to infinity. In the decay case, the authors indicate how to bound explicitly the total energy in terms of data. The continuous dependence of the solutions on the coefficient ρ is also proved in this article.     

Concentration-compactness principles for Moser–Trudinger inequalities: new results and proofs

We are concerned with the best exponent in Concentration-Compactness principles for the borderline case of the Sobolev inequality. We present a new approach, which both yields a rigorous proof of the relevant principle in the standard case when functions vanishing on the boundary are considered, and enables us to deal with functions with unrestricted boundary values.     

Multiple factor hierarchical clustering algorithm for?large scale web page and search engine clickstream data

The developments in World Wide Web and the advances in digital data collection and storage technologies during the last two decades allow companies and organizations to store and share huge amounts of electronic documents. It is hard and inefficient to manually organize, analyze and present these documents. Search engine helps users to find relevant information by present a list of web pages in response to queries. How to assist users to find the most relevant web pages from vast text collections efficiently is a big challenge. The purpose of this study is to propose a hierarchical clustering method that combines multiple factors to identify clusters of web pages that can satisfy users?? information needs. The clusters are primarily envisioned to be used for search and navigation and potentially for some form of visualization as well. An experiment on Clickstream data from a processional search engine was conducted to examine the results shown that the clustering method is effective and efficient, in terms of both objective and subjective measures.     

A Perron–Frobenius type result for integer maps and applications

Positivity - It is shown that for certain maps, including concave maps, on the d-dimensional lattice of positive integer points, ‘approximate’ eigenvectors can be found. Applications in...