Related papers: Improvement of graph theory Wei`s inequality

We present a simpler proof of Naji's characterization of circle graphs.

An inequality, which combines the concept of completely monotone functions with the theory of divided differences, is proposed. It is a straightforward generalization of a result, recently introduced by two of the present authors.

In this paper, by using analytical methods we obtain a generalization of the famous Kodaira embedding theorem.

We show a connection between the $CDE'$ inequality and the $CD\psi$ inequality. In particular, we introduce a $CD_\psi^\varphi$ inequality as a slight generalization of $CD\psi$ which turns out to be equivalent to $CDE'$ with appropriate…

We work out the graph limit theory for dense interval graphs. The theory developed departs from the usual description of a graph limit as a symmetric function $W(x,y)$ on the unit square, with $x$ and $y$ uniform on the interval $(0,1)$.…

The main aim of this paper is to prove a generalization of the classical Bohr theorem and as an application, we obtain a counterpart of Bohr theorem for the generalized Ces\'aro operator.

In this paper, we provide some new generalizations of Feng Qi type integral inequalities on time scales by using elementary analytic methods.

We study topological properties of the graph topology.

In this paper, we will consider the projections in a graph W*-algebra.

A generalization of the law of total covariance is presented and proved.

We prove a generalization of one of Lie's Theorems in the context of Lie-like algebras$^{2-nd}$.

In this note we present a refinement of the AM-GM inequality, and then we estimate in a special case the typical size of the improvement.

In this work, a generalization of pre-Gr\"{u}ss inequality is established. Several bounds for the difference between two \v{C}eby\v{s}ev functional are proved.

We relate the graph isomorphism problem to the solvability of certain systems of linear equations with nonnegative variables. This version replaces the two previous versions of this paper.

For given set of $m$ positive numbers satisfying the conditions: $$ a_1 \geq a_2 \geq , ... \geq a_m \geq 0, $$ the inequality $$ \sum_{s=1}^{m} (-1)^{s-1}a^r_s \geq \left[ \sum_{s=1}^{m} (-1)^{s-1}a_s\right]^r, \quad r > 1, $$ was proved…

In this paper, we improve the famous Reid Inequality related to linear operators. Some monotony results for positive operators are also established with a different approach from what is known in the existing literature. Lastly, Reid and…

Opial's inequality and its ramifications play an important role in the theory of differential and difference equations. A sharp unifying generalization of Opial's inequality is presented that contains both its continuous and discrete…

In this paper, a new general decomposition theory inspired from modular graph decomposition is presented. Our main result shows that, within this general theory, most of the nice algorithmic tools developed for modular decomposition are…

In this article, we derive a new generalization of Chebyshev inequality for random vectors. We demonstrate that the new generalization is much less conservative than the classical generalization.

Current graph neural networks (GNNs) lack generalizability with respect to scales (graph sizes, graph diameters, edge weights, etc..) when solving many graph analysis problems. Taking the perspective of synthesizing graph theory programs,…