Related papers: Metric hypergraphs and metric-line equivalences

We address the problem of merging graph and feature-space information while learning a metric from structured data. Existing algorithms tackle the problem in an asymmetric way, by either extracting vectorized summaries of the graph…

A metric space $\mathrm{M}=(M,\de)$ is {\em indivisible} if for every colouring $\chi: M\to 2$ there exists $i\in 2$ and a copy $\mathrm{N}=(N, \de)$ of $\mathrm{M}$ in $\mathrm{M}$ so that $\chi(x)=i$ for all $x\in N$. The metric space…

In a graph G, the cardinality of the smallest ordered set of vertices that distinguishes every element of V (G) (resp. E(G)) is called the vertex (resp. edge) metric dimension of G. In [16] it was shown that both vertex and edge metric…

Let $G=(V,E)$ be a connected graph and $d_{G}(u,v)$ be the shortest distance between the vertices $u$ and $v$ in $G$. A set $S=\{s_{1},s_{2},\cdots,s_{n}\}\subset V(G)$ is said to be a {\em resolving set} if for all distinct vertices $u,v$…

A metric basis in a graph $G$ is a smallest possible set $S$ of vertices of $G$, with the property that any two vertices of $G$ are uniquely recognized by using a vector of distances to the vertices in $S$. A strong metric basis is a…

For an ordered set W = {w1,w2,...,wk} of vertices and a vertex v in a connected graph G, the ordered k-vector r(v|W) := (d(v,w1),d(v,w2),...,d(v,wk)) is called the (metric) representation of v with respect to W, where d(x,y) is the distance…

For any metric $d$ on $\mathbb{R}^2$, an ($\mathbb{R}^2,d$)-geometric graph is a graph whose vertices are points in $\mathbb{R}^2$, and two vertices are adjacent if and only if their distance is at most 1. If $d=\|.\|_{\infty}$, the metric…

A hypergraph consists of a set of vertices and a set of subsets of vertices, called hyperedges. In the metro map metaphor, each hyperedge is represented by a path (the metro line) and the union of all these paths is the support graph (metro…

We present a connected metric space that does not contain any nontrivial separable connected subspace. Our space is a dense connected graph of a function from the real line satisfying Cauchy's equation.

Associated to any finite metric space are a large number of objects and quantities which provide some degree of structural or geometric information about the space. In this paper we show that in the setting of subsets of weighted Hamming…

A metric space is indivisible if for any partition of it into finitely many pieces one piece contains an isometric copy of the whole space. Continuing our investigation of indivisible metric spaces, we show that a countable ultrametric…

In this work we show that any connected locally connected graph defines a metric space having at least as many lines as vertices with only three exception: the complete multipartite graphs $K_{1,2,2}$, $K_{2,2,2}$ and $K_{2,2,2,2}$. This…

An oriented hypergraph is an oriented incidence structure that extends the concept of a signed graph. We introduce hypergraphic structures and techniques central to the extension of the circuit classification of signed graphs to oriented…

The betweenness structure of a finite metric space $M = (X, d)$ is a pair $\mathcal{B}(M) = (X,\beta_M)$ where $\beta_M$ is the so-called betweenness relation of $M$ that consists of point triplets $(x, y, z)$ such that $d(x, z) = d(x, y) +…

Given a connected graph $G$, a vertex $w\in V(G)$ distinguishes two different vertices $u,v$ of $G$ if the distances between $w$ and $u$ and between $w$ and $v$ are different. Moreover, $w$ strongly resolves the pair $u,v$ if there exists…

In previous work, we determined the metric dimension for a direct product of three isomorphic complete graphs. Turning to the case where the complete graphs may have different orders, there are three families we refer to as the upper,…

In this paper, we introduce a connection between two classical concepts of graph theory: \; metric dimension and distinguishing number. For a given graph $G$, let ${\rm dim}(G)$ and $D(G)$ represent its metric dimension and distinguishing…

Let $(X,d)$ be an unbounded metric space and $\tilde r=(r_n)_{n\in\mathbb N}$ be a scaling sequence of positive real numbers tending to infinity. We define the pretangent space $\Omega_{\infty, \tilde r}^{X}$ to $(X, d)$ at infinity as a…

The metric dimension of a graph is the smallest number of nodes required to identify all other nodes based on shortest path distances uniquely. Applications of metric dimension include discovering the source of a spread in a network,…

We show, following W. Holsztynski, that there exists a continuous metric d on the set of real numbers R such that any finite metric space is isometrically embeddable into (R,d).