Related papers: Improvement of graph theory Wei`s inequality

We establish some new generalizations of Erd\H{o}s-Mordell inequality by adding weights to its terms. Using these generalizations, we derived strengthened versions of the original Erd\H{o}s-Mordell inequality. We also found two other…

We give a generalization of the Shestakov-Umirbaev inequality which plays an important role in their solution of the tame generators conjecture.

A fundamental and challenging problem in spectral graph theory is to characterize which graphs are uniquely determined by their spectra. In Wang [J. Combin. Theory, Ser. B, 122 (2017): 438-451], the author proved that an $n$-vertex graph…

The goal of this paper is to unify two lines in a particular area of graph limits. First, we generalize and provide unified treatment of various graph limit concepts by means of a combination of model theory and analysis. Then, as an…

A generalization of the H\"older inequality is considered. Its relations with a previously obtained improvement of the Cauchy--Schwarz inequality are discussed.

In this paper, we obtain a sufficient condition for the existence of parity factors in a regular graph in terms of edge-connectivity. Moreover, we also show that our condition is sharp.

In this paper, we give a new generalization of the Bohr inequality in refined form both for bounded analytic functions, and for sense-preserving harmonic functions with analytic part being bounded.

We present a generalization of Schlick's bias and gain functions -- simple parametric curve-shaped functions for inputs in [0, 1]. Our single function includes both bias and gain as special cases, and is able to describe other smooth and…

In this paper, we state and prove a generalization of \'Ciri\'c fixed point theorems in metric space by using a new generalized quasi-contractive map. These theorems extend other well known fundamental metrical fixed point theorems in the…

In this work, a generalization of the well known Bernoulli inequality is obtained by using the theory of discrete fractional calculus. As far as we know our approach is novel.

In this note, we present an information diffusion inequality derived from an elementary argument, which gives rise to a very general Fano-type inequality. The latter unifies and generalizes the distance-based Fano inequality and the…

In this paper we shall prove a sharpened version of the Finsler-Hadwiger inequality which is a strong generalization of Weitzenbock inequality. After that we give another refinement of this inequality and in the final part we provide some…

Using nonstandard analysis, we generalise a classical result on equidistributions to integrable functions, and give an application of the Weil conjectures for algebraic curves, to equidistribution in characteristic zero.

In this paper, we will continue the investigation of Waring's problem, and give further improvements.

In this paper, we introduce a generalized concept of vertex transitivity in graphs called generalized vertex transitivity. We put forward a new invariant called transitivity number of a graph. The value of this invariant in different…

In this paper we introduce two new generalized variational inequalities, and we give some existence results of the solutions for these variational inequalities involving operators belonging to a recently introduced class of operators. We…

We describe a natural topological generalization of edge expansion for graphs to regular CW complexes and prove that this property holds with high probability for certain random complexes.

A generalisation of inner product spaces of an inequality due to Ostrowski and applications for sequences and integrals are given.

We are able to rederive in a very simple way the standard generalized Wick's theorem for overlaps of mean field wave functions by using the extension of the statistical Wick's theorem (Gaudin's theorem) in the appropriate limits.

We propose an algorithm for solving of the graph isomorphism problem. Also, we introduce the new class of graphs for which the graph isomorphism problem can be solved polynomially using the algorithm.