Related papers: Curvature dimension inequalities on directed graph…
In this paper we offer a metric similar to graph edit distance which measures the distance between two (possibly infinite)weighted graphs with finite norm (we define the norm of a graph as the sum of absolute values of its edges). The main…
We calculate the metric dimension of the total graph of a direct product of finite commutative antinegative semirings with their sets of zero-divisors closed under addition.
We develop a homotopy theory of directed graphs based on cubical homotopy groups, also referred to as A-groups or reduced GLMY homotopy groups. Localizing the category of directed graphs at morphisms that induce isomorphisms on these groups…
A mixed graph can be seen as a type of digraph containing some edges (two opposite arcs). Here we introduce the concept of sequence mixed graphs, which is a generalization of both sequence graphs and iterated line digraphs. These structures…
The main result of this paper gives a plenary proof on the curvature estimates for $k$ curvature equations with general right hand sides with $n<2k$ based on a concavity inequality. We further give a explicit lower bound of the inequality.
We study unbounded invariant and covariant derivations on the quantum disk. In particular we answer the question whether such derivations come from operators with compact parametrices and thus can be used to define spectral triples.
We study graphs with nonnegative Bakry-\'Emery curvature or Ollivier curvature outside a finite subset. For such a graph, via introducing the discrete Gromov-Hausdorff convergence we prove that the space of bounded harmonic functions is…
We consider isomorphism of controllable graphs and cospectrality of distance-regularized graphs (which are known to be distance-regular or distance-biregular) in relation to logical definability. While most characterizations of these…
Graph-level representations are crucial tools for characterising structural differences between graphs. However, comparing graphs with different cardinalities, even when sampled from the same underlying distribution, remains challenging.…
We define the total curvature of a semialgebraic embedding of a graph in the 3-dimensional Euclidean space. We prove that it satisfies a Chern-Lashof type inequality and we describe when the equality holds. We also prove a generalization of…
The diameter of a directed graph is the maximum distance between any pair of vertices. We study a problem that generalizes \textsc{Oriented Diameter}: For a given directed graph and a positive integer $d$, what is the minimum number of arc…
The theory of graphons has proven to be a powerful tool in many areas of graph theory. In this paper, we introduce several foundational aspects of the theory of digraphons -- asymmetric two-variable functions that arise as limits of…
We study the problem of computing the diameter and the mean distance of a continuous graph, i.e., a connected graph where all points along the edges, instead of only the vertices, must be taken into account. It is known that for continuous…
We find an upper bound for the asymptotic dimension of a hyperbolic metric space with a set of geodesics satisfying a certain boundedness condition studied by Bowditch. The primary example is a collection of tight geodesics on the curve…
The mixed metric dimension ${\rm mdim}(G)$ of a graph $G$ is the cardinality of a smallest set of vertices that (metrically) resolves each pair of elements from $V(G)\cup E(G)$. We say that $G$ is a max-mdim graph if ${\rm mdim}(G) = n(G)$.…
Long time existence and convergence to a circle is proved for radial graph solutions to a mean curvature type curve flow in warped product surfaces (under a weak assumption on the warp potential of the surface). This curvature flow…
The definition of Ricci curvature on graphs in Bakry-\'Emery's sense based on curvature dimension condition was introduced by Lin and Yau [\emph{Math. Res. Lett.}, 2010]. Hua and Lin [\emph{Comm. Anal. Geom.}, 2019] classified unweighted…
We study possible restrictions on the structure of curvature corrections to gravitational theories in the context of their corresponding Kac--Moody algebras, following the initial work on E10 in Class. Quant. Grav. 22 (2005) 2849. We first…
For a given graph $G$, the metric and edge metric dimensions of $G$, $\dim(G)$ and ${\rm edim}(G)$, are the cardinalities of the smallest possible subsets of vertices in $V(G)$ such that they uniquely identify the vertices and the edges of…
We clarify the correspondence between the two approaches to quantum graphs: via quantum adjacency matrices and via quantum relations. We show how the choice of a (possibly non-tracial) weight manifests itself on the quantum relation side…