相关论文: Improvement of graph theory Wei`s inequality
In this paper, we present an equitable partition theorem of tensors, which gives the relations between $H$-eigenvalues of a tensor and its quotient equitable tensor and extends the equitable partitions of graphs to hypergraphs. Furthermore,…
E-generalization computes common generalizations of given ground terms w.r.t. a given equational background theory E. In 2005 [arXiv:1403.8118], we had presented a computation approach based on standard regular tree grammar algorithms, and…
A generalised Weber function is given by $\w_N(z) = \eta(z/N)/\eta(z)$, where $\eta(z)$ is the Dedekind function and $N$ is any integer; the original function corresponds to $N=2$. We classify the cases where some power $\w_N^e$ evaluated…
A GGC (Generalized Gamma Convolution) representation of Riemann's Xi-function is constructed.
This paper presents foundational theoretical results on distributed parameter estimation for undirected probabilistic graphical models. It introduces a general condition on composite likelihood decompositions of these models which…
We explore and generalize a Cauchy-Schwarz-type inequality originally proved in [Electronic Journal of Linear Algebra 35, 156-180 (2019)]: $\|\mathbf{v}^2\|\|\mathbf{w}^2\| - \langle\mathbf{v}^2,\mathbf{w}^2\rangle \leq…
A paradigm that was successfully applied in the study of both pure and algorithmic problems in graph theory can be colloquially summarized as stating that "any graph is close to being the disjoint union of expanders". Our goal in this paper…
We study some versions of the statement of Hadwiger's conjecture for finite as well as infinite graphs.
The higher-order Cheeger inequalities were established for graphs by Lee, Oveis Gharan and Trevisan. We prove analogous inequalities for graphons in this article.
We prove the Strengthened Hanna Neumann Conjecture, in its common graph theoretic formulation. Our original approach to this conjecture used cohomology of sheaves on graphs, although here we give a short combinatorial proof that we found in…
The Wiener index of a graph $G$, denoted $W(G)$, is the sum of the distances between all pairs of vertices in $G$. \'E. Czabarka, et al. conjectured that for an $n$-vertex, $n\geq 4$, simple quadrangulation graph $G$,…
We compute the depth and (give bounds for) the regularity of generalized binomial edge ideals associated with generalized block graphs.
This paper introduces the notion of a Galois point for a finite graph, using the theory of linear systems of divisors for graphs discovered by Baker and Norine. We present a new characterization of complete graphs in terms of Galois points.
The CD inequalities and CDE inequalities are useful in the estimate of curvature on graphs. This article is based on the ufinite graph with large girth, and finally concludes some curvature estimate in CD and CDE.
In this paper, we prove Newton-Maclaurin type inequalities for functions obtained by linear combination of two neighboring primary symmetry functions, which is a generalization of the classical Newton-Maclaurin inequality.
We generalize the well-known mean value inequality of subharmonic functions for a slightly more general function class. We also apply this generalized mean value inequality to weighted boundary behavior and nonintegrability questions of…
We extend the theory of probability graphons, continuum representations of edge-decorated graphs arising in graph limits theory, to the 'right convergence' point of view. First of all, we generalise the notions of overlay functionals and…
This paper aims to characterize the function appearing in the weighted Hermite-Hadamard inequality. We provide improved inequalities for the weighted means as applications of the obtained results. Modifications of the weighted…
Our purpose in this present paper is to investigate generalized integration formulas containing the generalized $k$-Bessel function $W_{v,c}^{k}(z)$ to obtain the results in representation of Wright-type function. Also, we establish certain…
We improve recent results relating graph eigenvalues to other graph parameters like girth, domination number, and minimum degree.