Related papers: An arc graph distance formula for the flip graph
The distance matrix of a connected graph is the symmetric matrix with columns and rows indexed by the vertices and entries that are the pairwise distances between the corresponding vertices. We give a construction for graphs which differ in…
For any graph $G = (V,E)$ and positive integer $d$, the exact distance-$d$ graph $G_{=d}$ is the graph with vertex set $V$, where two vertices are adjacent if and only if the distance between them in $G$ is $d$. We study the exact…
Large-scale graphs are widely used to represent object relationships in many real world applications. The occurrence of large-scale graphs presents significant computational challenges to process, analyze, and extract information. Graph…
For a connected graph $G$ and $\alpha\in [0,1)$, the distance $\alpha$-spectral radius of $G$ is the spectral radius of the matrix $D_{\alpha}(G)$ defined as $D_{\alpha}(G)=\alpha T(G)+(1-\alpha)D(G)$, where $T(G)$ is a diagonal matrix of…
In this paper, we establish a simple formula for computing the Lin-Lu-Yau Ricci curvature on graphs. For any edge $xy$ in a simple locally finite graph $G$, the curvature $\kappa(x,y)$ can be expressed as a cost function of an optimal…
We study the problem of finding a triangulation T of a planar point set S such as to minimize the expected distance between two points x and y chosen uniformly at random from S. By distance we mean the length of the shortest path between x…
We give a new algorithm to simplify a given triangulation with respect to a given curve. The simplification uses flips together with powers of Dehn twists in order to complete in polynomial time in the bit-size of the curve.
In this paper, we give a characterization of distance matrices of distance-regular graphs to be invertible.
In this paper, we consider the distance spectra of the derangement graphs. First we give a constructive proof that the connected derangement graphs are of diameter 2. Then we obtain their distance spectra. In particular, we determine all…
We obtain a coarse relationship between geometric intersection numbers of curves and the sum of their subsurface projection distances with explicit quasi-constants. By using this relationship, we give applications in the studies of the…
Closeness is an important measure of network centrality. In this article we will calculate the closeness of graphs, created by using operations on graphs. We will prove a formula for the closeness of shadow graphs. We will calculate the…
Simplifying graphs is a very applicable problem in numerous domains, especially in computational geometry. Given a geometric graph and a threshold, the minimum-complexity graph simplification asks for computing an alternative graph of…
Let $D(G)=(d_{ij})_{n\times n}$ denote the distance matrix of a connected graph $G$ with order $n$, where $d_{ij}$ is equal to the distance between vertices $v_{i}$ and $v_{j}$ in $G$. A graph is called distance integral if all eigenvalues…
Metric graphs are meaningful objects for modeling complex structures that arise in many real-world applications, such as road networks, river systems, earthquake faults, blood vessels, and filamentary structures in galaxies. To study metric…
We build an augmentation of the Masur-Minsky marking complex by Groves-Manning combinatorial horoballs to obtain a graph we call the augmented marking complex, $\mathcal{AM}(S)$. Adapting work of Masur-Minsky, we prove that…
A triangulation of a point configuration is regular if it can be given by a height function, that is every point gets lifted to a certain height and projecting the lower convex hull gives the triangulation. Checking regularity of a…
In this paper we study the geometry of graph spaces endowed with a special class of graph edit distances. The focus is on geometrical results useful for statistical pattern recognition. The main result is the Graph Representation Theorem.…
Mapper graphs are widely used tools in topological data analysis and visualization. They can be understood as discrete approximations of Reeb graphs, providing insight into the shape and connectivity of complex data. Given a…
A (multi)set of segments in the plane may form a TSP tour, a matching, a tree, or any multigraph. If two segments cross, then we can reduce the total length with the following flip operation. We remove a pair of crossing segments, and…
We state and prove some counting formulas relating to cliques in the distant graphs of projective lines over finite rings. As a preliminary to this, we prove a decomposition theorem for the graphs in terms of the direct-product…