Related papers: A Whitney map onto the Long Arc

Let $G$ be a graph on $n\geq 3$ vertices. A graph $G$ is almost distance-hereditary if each connected induced subgraph $H$ of $G$ has the property $d_{H}(x,y)\leq d_{G}(x,y)+1$ for any pair of vertices $x,y\in V(H)$. A graph $G$ is called…

The tent map is an elementary example of an interval map possessing many interesting properties, such as dense periodicity, exactness, Lipschitzness and a kind of length-expansiveness. It is often used in constructions of dynamical systems…

The complex dynamics of baker's map and its variants in an infinite-precision mathematical domain have been extensively analyzed in the past five decades. However, their real structure implemented in a finite-precision computer remains…

Binomial Cayley graphs are obtained by considering the binomial coefficient of the weight function of a given Cayley graph and a natural number. We introduce these objects and study two families: one associated with symmetric groups and the…

Let $(G,w)$ be a weighted graph with a weight-function $w: E(G)\to \mathbb R\backslash\{0\}$. A weighted graph $(G,w)$ is invertible to a new weighted graph if its adjacency matrix is invertible. A graph inverse has combinatorial interest…

The state spaces of machines admit the structure of time. A homotopy theory respecting this additional structure can detect machine behavior unseen by classical homotopy theory. In an attempt to bootstrap classical tools into the world of…

It is observed that a natural analog of the Hahn-Banach theorem is valid for metric functionals but fails for horofunctions. Several statements of the existence of invariant metric functionals for individual isometries and 1-Lipschitz maps…

We study periodic, piecewise linear maps on the plane starting with the Mort Brown's map. We show that if the number of pieces is two, there is only a short list of possible periods (this fact can be seen as the crystallographic restriction…

A general method for constructing sharply $k$-arc-transitive digraphs, i.e. digraphs that are $k$-arc-transitive but not $(k+1)$-arc-transitive, is presented. Using our method it is possible to construct both finite and infinite examples.…

We study models of weighted exponential random graphs in the large network limit. These models have recently been proposed to model weighted network data arising from a host of applications including socio-econometric data such as migration…

We show that extending an embedding of a graph $\Gamma$ in a surface to an embedding of a Hamiltonian supergraph can be blocked by certain planar subgraphs but, for some subdivisions of $\Gamma$, Hamiltonian extensions must exist.

We endow the set of probability measures on a weighted graph with a Monge--Kantorovich metric, induced by a function defined on the set of vertices. The graph is assumed to have $n$ vertices and so, the boundary of the probability simplex…

We explore to what extent the properties of a Gauss diagram are affected by the choice of its Hamiltonian cycle. We present an example of a realizable Gauss diagram and an unrealizable Gauss diagram that differ only by a choice of the…

We prove the existence of continuous boundary extensions (Cannon-Thurston maps) for the inclusion of a vertex space into a tree of (strongly) relatively hyperbolic spaces satisfying the qi-embedded condition. This implies the same result…

We show that there exists an infinite family of cubic $2$-connected non-hamiltonian graphs with girth $5$ containing a unique longest cycle.

Based on the Carath\'eodory -Pesin structure theory[11], we introduce three notions of topological pressure of a proper map and provide some properties of these notions. For the proper map of a locally compact separable metric space, we…

We extend harmonic map techniques to the setting of more general differential equations in conformal geometry. We obtain an extension of Siu's rigidity to Kahler-Weyl geometry and apply the latter to Vaisman's conjecture. Other applications…

A graph is called traceable if it contains a Hamilton path, i.e., a path passing through all its vertices. Let $G$ be a graph on $n$ vertices. $G$ is called claw-$o_{-1}$-heavy if every induced claw ($K_{1,3}$) of $G$ has a pair of…

In this paper, we introduce the concept of monotone Gregus-\'Ciri\'c-contraction mappings in weighted digraphs. Then we establish a fixed point theorem for monotone Gregus-\'Ciri\'c-contraction mappings defined in convex weighted digraphs.

Given a finite directed graph with $n$ vertices, we define a metric $d_G$ on $\mathbb{F}_q^n$, where $\mathbb{F}_q$ is the finite field with $q$ elements. The weight of a word is defined as the number of vertices that can be reached by a…