Related papers: Metric graphs of negative type

A biased graph is a graph $G$, together with a distinguished subset $\mathcal{B}$ of its cycles so that no Theta-subgraph of $G$ contains precisely two cycles in $\mathcal{B}$. A large number of biased graphs can be constructed by choosing…

Given a dense countable set in a metric space, the infinite random geometric graph is the random graph with the given vertex set and where any two points at distance less than 1 are connected, independently, with some fixed probability. It…

The median of a graph $G$ with weighted vertices is the set of all vertices $x$ minimizing the sum of weighted distances from $x$ to the vertices of $G$. For any integer $p\ge 2$, we characterize the graphs in which, with respect to any…

An embeddability criterion for zero-dimensional metrizable topological spaces in zero-dimensional metrizable topological groups is given. A space which can be embedded as a closed subspace in a zero-dimensional metrizable group but is not…

Assume that there is a free group action of automorphisms on a bipartite graph. If there is a perfect matching on the factor graph, then obviously there is a perfect matching on the graph. Surprisingly, the reversed is also true for…

Let $G$ be a compact connected Lie group and $H$ a closed subgroup of $G$. Suppose the homogeneous space $G/H$ is effective and has dimension 3 or higher. Consider a $G$-invariant, symmetric, positive-semidefinite, nonzero (0,2)-tensor…

We describe the class of graphs for which all metric spaces with diametrical graphs belonging to this class are ultrametric. It is shown that a metric space $(X, d)$ is ultrametric iff the diametrical graph of the metric $d_{\varepsilon}(x,…

We study topological obstructions to the existence of a Riemannian metric on manifolds with boundary such that the scalar curvature is non-negative and the boundary is mean convex. We construct many compact manifolds with boundary which…

A signed graph is said to be sign-symmetric if it is switching isomorphic to its negation. Bipartite signed graphs are trivially sign-symmetric. We give new constructions of non-bipartite sign-symmetric signed graphs. Sign-symmetric signed…

We show that the metric of nonpositively curved graph manifolds is determined by its geodesic flow. More precisely we show that if the geodesic flows of two nonpositively curved graph manifolds are $C^0$ conjugate then the spaces are…

We introduce a new class of countably infinite random geometric graphs, whose vertices are points in a metric space, and vertices are adjacent independently with probability p if the metric distance between the vertices is below a given…

We expose a class of discrete metric spaces, for which bounded geometry is equivalent to the property A of G. Yu. This class includes the coarse disjoint union of $(\mathbb Z/2\mathbb Z)^n$, $n\in\mathbb N$, and consists of spaces of simple…

Let $\beta>0$. Motivated by jumbled graphs defined by Thomason, the celebrated expander mixing lemma and Haemers's vertex separation inequality, we define that a graph $G$ with $n$ vertices is a weakly $(n,\beta)$-graph if $\frac{|X|…

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

The problem of finding the general classification of geodetic graphs is still open. We believe that one of the obstacles to attain this goal is that geodetic graphs lack a structural description. In other words, their fundamental properties…

It is shown the antisymmetric part of the metric tensor is the potential for the spin field. Various metricity conditions are discussed and comparisons are made to other theories, including Einstein's. It is shown in the weak field limit…

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 mixed graph is obtained by orienting some edges of a simple graph. The positive inertia index of a mixed graph is defined as the number of positive eigenvalues of its Hermitian adjacency matrix, including multiplicities. This matrix was…

We define a new integer invariant of a finite graph G, the freeness index, that measures the extent to which G can be embedded in the 3-sphere so that it and its subgraphs have ``simple" complements, i.e., complements which are homeomorphic…

Let $G$ be a graph with an adjacent matrix $A(G)$. The multiplicity of an arbitrary eigenvalue $\lambda$ of $A(G)$ is denoted by $m_\lambda(G)$. In \cite{Wong}, the author apply the Pater-Wiener Theorem to prove that if the diameter of $T$…