Related papers: Bounds on curvature in regular graphs
We study the average number $\mathcal{A}(G)$ of colors in the non-equivalent colorings of a graph $G$. We show some general properties of this graph invariant and determine its value for some classes of graphs. We then conjecture several…
It is known that an $n$-dimensional convex body which is typical in the sense of Baire category, shows a simple, but highly non-intuitive curvature behaviour: at almost all of its boundary points, in the sense of measure, all curvatures are…
We derive pointwise curvature estimates for graphical mean curvature flows in higher codimensions. To the best of our knowledge, this is the first such estimates without assuming smallness of first derivatives of the defining map. An…
A graph is regularizable if it is possible to assign weights to its edges so that all nodes have the same degree. Weights can be positive, nonnegative or arbitrary as soon as the regularization degree is not null. Positive and nonnegative…
We prove that the total curvature of any planar graph with nonnegative combinatorial curvature is an integral multiple of $\frac{1}{12}.$ As a corollary, this answers a question proposed by T. R\'eti.
In this paper, we study the mean curvature flow of graphs with Neumann boundary condition. The main aim is to use the maximum principle to get the boundary gradient estimate for solutions. In particular, we obtain the corresponding…
The characterization of complex networks with tools originating in geometry, for instance through the statistics of so-called Ricci curvatures, is a well established tool of network science. There exist various types of such Ricci…
For every connected graph $G$ and surface $S$, we consider the well-known string of inequalities $\delta_S(G) \leq \mu_S(G) \leq \nu_S(G)$, where $\mu$ and $\nu$ denote skewness and crossing number and $\delta$ is the Euler-formula lower…
We express the discrete Ricci curvature of a graph as the minimal eigenvalue of a family of matrices, one for each vertex of a graph whose entries depend on the local adjaciency structure of the graph. Using this method we compute or bound…
This article introduces and studies a new class of graphs motivated by discrete curvature. We call a graph resistance nonnegative if there exists a distribution on its spanning trees such that every vertex has expected degree at most two in…
In this paper, we derive Li-Yau inequality for unbounded Laplacian on complete weighted graphs with the assumption of the curvature-dimension inequality $CDE'(n,K)$, which can be regarded as a notion of curvature on graphs. Furthermore, we…
In this work we prove the existence and uniqueness of Killing graphs with prescribed mean curvature considering functions which are not necessarily constant along the flow lines of the Killing vector field.
The theory of classical types of curves in normed planes is not strongly developed. In particular, the knowledge on existing concepts of curvatures of planar curves is widespread and not systematized in the literature. Giving a…
In this note, we provide Steinerberger curvature formulas for block graphs, discuss curvature relations between two graphs and the graph obtained by connecting them via a bridge, and show that self-centered Bonnet-Myers sharp graphs are…
We propose a Law of Nature? Viz., Pure Regularity Occurs at Na\"ive Levels and Regularity has Affinity with Evenness. In a series of three papers, it was established that regular Euler graphs with only one type of (pure) cycles are…
We establish the existence of hypersurfaces with constant mean curvature and a prescribed boundary in Euclidean space, represented as radial graphs over domains of the unit sphere. Under the assumptions that the mean curvature of the…
Following P. M. H. Wilson's paper on sectional curvatures of Kahler moduli, we consider a natural Riemannian metric on a hypersurface f=1 in a real vector space, defined using the Hessian of a homogeneous polynomial f. We give examples to…
We prove an inequality for the curvature of level sets of minimal graphs having vanishing boundary values and show that if the boundary is concave, then all the level sets are concave.
We establish for the first time the explicit curvature formulas for the horizontal and vertical edges of the strong product of two regular graphs. We complement this result with showing that there does not exist an analogous formula for the…
In this paper we study the uniqueness of graphical mean curvature flow. We consider as initial conditions graphs of locally Lipschitz functions and prove that in the one dimensional case solutions are unique without any further assumptions.…