Related papers: Bow Metrics and Hyperbolicity

We show that several types of graph drawing in the hyperbolic plane require features of the drawing to be separated from each other by sub-constant distances, distances so small that they can be accurately approximated by Euclidean…

A mapping $\alpha : V(G) \to V(H)$ from the vertex set of one graph $G$ to another graph $H$ is an isometric embedding if the shortest path distance between any two vertices in $G$ equals the distance between their images in $H$. Here, we…

Let $H$ be an edge-weighted graph, and let $G$ be a subgraph of $H$. We say that $G$ is an $f$-fault-tolerant $t$-spanner for $H$, if the following is true for any subset $F$ of at most $f$ edges of $G$: For any two vertices $p$ and $q$,…

We find a set of necessary and sufficient conditions under which the weight $w:E\to\mathbb R^+$ on the graph $G=(V,E)$ can be extended to a pseudometric $d:V\times V\to\mathbb R^+$. If these conditions hold and $G$ is a connected graph,…

Scharlemann and Thompson define the width of a 3-manifold M as a notion of complexity based on the topology of M. Their original definition had the property that the adjacency relation on handles gave a linear order on handles, but here we…

The {\em metric dimension} of a graph $\Gamma$ is the least number of vertices in a set with the property that the list of distances from any vertex to those in the set uniquely identifies that vertex. We consider the Grassmann graph…

We generalize subgraph densities, arising in dense graph limit theory, to Markov spaces (symmetric measures on the square of a standard Borel space). More generally, we define an analogue of the set of homomorphisms in the form of a measure…

The NP-hard Metric Dimension problem is to decide for a given graph G and a positive integer k whether there is a vertex subset of size at most k that separates all vertex pairs in G. Herein, a vertex v separates a pair {u,w} if the…

Given any two vertices u, v of a random geometric graph, denote by d_E(u,v) their Euclidean distance and by d_G(u,v) their graph distance. The problem of finding upper bounds on d_G(u,v) in terms of d_E(u,v) has received a lot of attention…

A path system $\mathscr{P}$ in a graph $G=(V,E)$ is a collection of paths, with exactly one path between any two vertices in $V$. A path system is said to be consistent if it is closed under subpaths. We say that a path system $\mathscr{P}$…

Random hyperbolic graphs were recently introduced by Krioukov et. al. [KPKVB10] as a model for large networks. Gugelmann, Panagiotou, and Peter [GPP12] then initiated the rigorous study of random hyperbolic graphs using the following model:…

Metric dimensions and metric basis are graph invariants studied for their use in locating and indexing nodes in a graph. It was recently established that for bicyclic graph of type-III ($\Theta $-graphs), the metric dimension is $3$ only,…

The goal of this paper is to introduce and study analogues of the Euclidean Funk and Hilbert metrics on open convex subsets $\Omega$ of hyperbolic or spherical spaces. At least at a formal level, there are striking similarities among the…

This paper has two main objectives. First, for an arbitrary calibrated manifold $(X,\phi)$, we define notions of $R_\phi$-hyperbolicity and $\phi$-hyperbolicity, which respectively generalize the notions of Kobayashi and Brody hyperbolicity…

Let $S$ be an oriented closed surface of genus at least two, and let $M = S \times (0,1)$. Suppose that $h$ is a Riemannian metric on $S$ with curvature strictly greater than $-1$, $h^{*}$ is a Riemannian metric on $S$ with curvature…

We define metrics in space that are natural counterparts of the hyperbolic metric in plane domains, using the characterization of the hyperbolic metric due to Beardon and Pommerenke. We obtain inequalities for these metrics under…

Let $G$ be a strongly connected directed graph and $u,v,w\in V(G)$ be three vertices. Then $w$ strongly resolves $u$ to $v$ if there is a shortest $u$-$w$-path containing $v$ or a shortest $w$-$v$-path containing $u$. A set $R\subseteq…

Let $G = V, E$ be a simple connected undirected graph. A set $X \subseteq V$ is \emph{geodesically convex} if for any pair of vertices $x, y \in X$, all vertices on all shortest paths in $G$ from $x$ to $y$ are contained in $X$. A set $H…

The classical random graph model $G(n,\lambda/n)$ satisfies a `duality principle', in that removing the giant component from a supercritical instance of the model leaves (essentially) a subcritical instance. Such principles have been proved…

While research on the geometry of planar graphs has been active in the past decades, many properties of planar metrics remain mysterious. This paper studies a fundamental aspect of the planar graph geometry: covering planar metrics by a…