相关论文: Lines in metric spaces: universal lines counted wi…

In a series of three papers we develop an end space theory for directed graphs. As for undirected graphs, the ends of a digraph are points at infinity to which its rays converge. Unlike for undirected graphs, some ends are joined by limit…

Let $E \subset {\Bbb F}_q^d$, the $d$-dimensional vector space over a finite field with $q$ elements. Construct a graph, called the distance graph of $E$, by letting the vertices be the elements of $E$ and connect a pair of vertices…

The paper is devoted to the geometry of transportation cost spaces and their generalizations introduced by Melleray, Petrov, and Vershik (2008). Transportation cost spaces are also known as Arens-Eells, Lipschitz-free, or Wasserstein $1$…

A line digraph $L(G) = (A, E)$ is the digraph constructed from the digraph $G = (V, A)$ such that there is an arc $(a,b)$ in $L(G)$ if the terminal node of $a$ in $G$ is the initial node of $b$. The maximum number of arcs in a line digraph…

A set of vertices $S$ resolves a graph if every vertex is uniquely determined by its vector of distances to the vertices in $S$. The metric dimension of a graph is the minimum cardinality of a resolving set of the graph. Fix a connected…

A self-map $T$ of a $\nu$-generalized metric space $(X,d\,)$ is said to be a Ciric-Matkowski contraction if $d(Tx,Ty)<d(x,y)$, for $x\neq y$, and, for every $\epsilon>0$, there is $\delta>0$ such that $d(x,y)<\delta+\epsilon$ implies…

The paper studies a general scheme for constructing metrics on a product of metric spaces by means of a family of continuous convex functions. This construction includes the conventional $p$-metrics and generates metrics that are…

We show that the Ramsey number is linear for every uniform hypergraph with bounded-degree. This is a hypergraph extension of the famous theorem for ordinary graphs which Chv\'atal et al. showed in 1983. Our proof is simple, contains the…

For arbitrary star graph $S$ with a non-degenerate vertex labeling $l\colon V(S) \to \mathbb{R}^+$ we denote by $d_l$ the corresponding ultrametric on the vertex set $V(S)$ of $S$. We characterize the class $\bf US$ of all ultrametric…

In this paper,\ the authors define a space with an uniform base at non-isolated points, give some characterizations of images of metric spaces by boundary-compact maps, and study certain relationship among spaces with special base…

The concept of metric dimension has applications in a variety of fields, such as chemistry, robotic navigation, and combinatorial optimization. We show bounds for graphs with $n$ vertices and metric dimension $\beta$. For Hamiltonian…

Using the technique of the metrization theorem of uniformities with countable bases, in this note we provide, test and compare an explicit algorithm to produce a metric $d(x,y)$ between the vertices $x$ and $y$ of an affinity weighted…

Richard Guy asked for the largest set of points which can be placed in the plane so that their pairwise distances are rational numbers. In this article, we consider such a set of rational points restricted to a given hyperbola. To be…

Given two graphs, a mapping between their edge-sets is cycle-continuous, if the preimage of every cycle is a cycle. The motivation for this notion is Jaeger's conjecture that for every bridgeless graph there is a cycle-continuous mapping to…

We study characteristics which might distinguish two-graphs by introducing different numerical measures on the collection of graphs on $n$ vertices. Two conjectures are stated, one using these numerical measures and the other using the deck…

Gale and Ryser found a criterion for existence of a binary matrix with given row and column sums. Mirsky extended the theorem of Gale and Ryser to $q$-ary matrices. In this paper, we are interested in higher dimensional extension of these…

In \cite[\, An, V.T., Tuyen, Q.L. and Dung, V.N., Stone-type theorem on $b$-metric spaces and applications, Topology Appl. 185-186 (2015), 50-64.]{an}, An et al. had provided a sufficient condition for $b$-metric spaces to be metrizable.…

Consider the continuum of points along the edges of a network, i.e., a connected, undirected graph with positive edge weights. We measure the distance between these points in terms of the weighted shortest path distance, called the network…

We show that every outerplanar graph $G$ can be linearly embedded in the plane such that the number of distinct distances between pairs of adjacent vertices is at most thirteen and there is no intersection between the image of a vertex and…

In this paper, we first discussed multiplicative metric mapping by giving some topological properties of the relevant multiplicative metric space. As an interesting result of our discussions, we observed that the set of positive real…