Related papers: Paths in graphs: bounded geometry and property A

A new class of distances for graph vertices is proposed. This class contains parametric families of distances which reduce to the shortest-path, weighted shortest-path, and the resistance distances at the limiting values of the family…

An arithmetical structure on a graph is given by a labeling of the vertices which satisfies certain divisibility properties. In this note, we look at several families of graphs and attempt to give counts on the number of arithmetical…

We propose a notion of continuous path for locally finite metric spaces, taking inspiration from the recent development of A-theory for locally finite connected graphs. We use this notion of continuity to derive an analogue in Z^2 of the…

For non-compact manifolds with boundary we prove that bounded geometry defined by coordinate-free curvature bounds is equivalent to bounded geometry defined using bounds on the metric tensor in geodesic coordinates. We produce a nice atlas…

A connected subgraph of a graph is isometric if it preserves distances. In this short note, we provide counterexamples to several variants of the following general question: When a graph $G$ is edge covered by connected isometric subgraphs…

Let B be a finite collection of geometric (not necessarily convex) bodies in the plane. Clearly, this class of geometric objects naturally generalizes the class of disks, lines, ellipsoids, and even convex polygons. We consider geometric…

A consistent path system in a graph $G$ is an intersection-closed collection of paths, with exactly one path between any two vertices in $G$. We call $G$ metrizable if every consistent path system in it is the system of geodesic paths…

Let $G$ be a graph with a vertex set $V$. The graph $G$ is path-proximinal if there are a semimetric $d \colon V \times V \to [0, \infty[$ and disjoint proximinal subsets of the semimetric space $(V, d)$ such that $V = A \cup B$, and…

The metric dimension of non-component graph, associated to a finite vector space, is determined. It is proved that the exchange property holds for resolving sets of the graph, except a special case. Some results are also related to an…

Using ideas from shape theory we embed the coarse category of metric spaces into the category of direct sequences of simplicial complexes with bonding maps being simplicial. Two direct sequences of simplicial complexes are equivalent if one…

A geometric graph is a graph drawn in the plane so that its vertices and edges are represented by points in general position and straight line segments, respectively. A vertex of a geometric graph is called pointed if it lies outside of the…

We introduce a new variant of the coarse Baum-Connes conjecture designed to tackle coarsely disconnected metric spaces called the boundary coarse Baum-Connes conjecture. We prove this conjecture for many coarsely disconnected spaces that…

In a graph G, cardinality of the smallest ordered set of vertices that distinguishes every element of V (G) is the (vertex) metric dimension of G. Similarly, the cardinality of such a set is the edge metric dimension of G, if it…

A geometric grid class consists of those permutations that can be drawn on a specified set of line segments of slope \pm1 arranged in a rectangular pattern governed by a matrix. Using a mixture of geometric and language theoretic methods,…

We study separating systems of the edges of a graph where each member of the separating system is a path. We conjecture that every $n$-vertex graph admits a separating path system of size $O(n)$ and prove this in certain interesting special…

We study property A for metric spaces $X$ with bounded geometry introduced by Guoliang Yu. Property A is an amenability-type condition, which is less restrictive than amenability for groups. The property has a connection with…

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,…

We introduce a generalization for bounded geometry that we call bounded scale measure. We show that bounded scale measure is a coarse invariant unlike bounded geometry. We then show equivalent definitions for spaces with bounded scale…

We define thin and asymptotically scattered metric spaces as asymptotic counterparts of discrete and scattered metric spaces respectively. We characterize asymptotically scattered spaces in terms of prohibited subspaces, and classify thin…

The metric (resp. edge metric) dimension of a simple connected graph $G$, denoted by dim$(G)$ (resp. edim$(G)$), is the cardinality of a smallest vertex subset $S\subseteq V(G)$ for which every two distinct vertices (resp. edges) in $G$…