Related papers: Ollivier curvature, betweenness centrality and ave…
We prove new lower bounds on the modularity of graphs. Specifically, the modularity of a graph $G$ with average degree $\bar d$ is $\Omega(\bar{d}^{-1/2})$, under some mild assumptions on the degree sequence of $G$. The lower bound…
We show that for every connected graph $G$ of diameter $\ge 3$, the graph $G^3$ has average degree $\ge 7/4 \delta(G)$. We also provide an example showing that this bound is best possible. This resolves a question of Hegarty \cite{PH}.
We consider a variant of metrised graphs where the edge lengths take values in a commutative monoid, as a higher-rank generalisation of the notion of a tropical curve. Divisorial gonality, which Baker and Norine defined on combinatorial…
The edit distance between two graphs is a widely used measure of similarity that evaluates the smallest number of vertex and edge deletions/insertions required to transform one graph to another. It is NP-hard to compute in general, and a…
We explore the notion of m-intermediate Ricci curvature assumption introduced by Brendle-Hirsch-Johne further. If a manifold has non-negative m-intermediate Ricci curvature and stable weighted slicing of order m-1, then the last slice has…
We collect some general results on graph limits associated to hereditary classes of graphs. As examples, we consider some classes defined by forbidden subgraphs and some classes of intersection graphs, including triangle-free graphs,…
It is shown that exactly 7 distance-transitive cubic graphs among the existing 12 possess a particular ultrahomogeneous property with respect to oriented cycles realizing the girth that allows the construction of a related Cayley digraph…
Let $(n^+, n^0, n^-)$ denote the inertia of a graph $G$ with $n$ vertices. Nordhaus-Gaddum bounds are known for inertia, except for an upper bound for $n^-$. We conjecture that for any graph \[ n^-(G) + n^-(\bar{G}) \le 1.5(n - 1), \] and…
We present a finer quantitative version of an observation due to Breuillard, Green, Guralnick and Tao which tells that for finite non-bipartite Cayley graphs, once the nontrivial eigenvalues of their normalized adjacency matrices are…
There are several centrality measures that have been introduced and studied for real world networks. They account for the different vertex characteristics that permit them to be ranked in order of importance in the network. Betweenness…
This is the second of two papers wherein we estimate multiscale least squares approximations of certain measures by Menger-type curvatures. More specifically, we study an arbitrary d-regular measure on a real separable Hilbert space. The…
In a prequel to this paper \cite{curvature1} a notion of curvature on the integers was introduced, based on the technique of "analytic continuation between primes", introduced in \cite{laplace}. In this paper, which is essentially…
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…
The transmission of a vertex $v$ of a graph $G$ is the sum of distances from $v$ to all the other vertices in $G$. The Wiener complexity of $G$ is the number of different transmissions of its vertices. Similarly, the eccentric complexity of…
Interval graphs and interval orders are deeply linked. In fact, edges of an interval graphs represent the incomparability relation of an interval order, and in general, of different interval orders. The question about the conditions under…
The genus graphs have been studied by many authors, but just a few results concerning in special cases: Planar, Toroidal, Complete, Bipartite and Cartesian Product of Bipartite. We present here a derive general lower bound for the genus of…
Amply regular graphs are graphs with local distance-regularity constraints. In this paper, we prove a weaker version of a conjecture proposed by Qiao, Park, and Koolen on diameter bounds of amply regular graphs and make new progress on…
We study convex entire graphs evolving with normal velocity equal to a positive power of the mean curvature. Under mild assumptions we prove longtime existence.
Two classical concepts of centrality in a graph are the median and the center. The connected notions of the status and the radius of a graph seem to be in no relation. In this paper, however, we show a clear connection of both concepts, as…
A middle-cube is an induced subgraph consisting of nodes at the middle two layers of a hypercube. The middle-cubes are related to the well-known Revolving Door (Middle Levels) conjecture. We study the middle-cube graph by completely…