Related papers: Periodic Steiner networks minimizing length

We study the spatial isosceles three body problem, which is a system with two degrees of freedom after modulo the rotation symmetry. For certain choices of energy and angular momentum, we find some disk-like global surfaces of section with…

In a geometric network G = (S, E), the graph distance between two vertices u, v in S is the length of the shortest path in G connecting u to v. The dilation of G is the maximum factor by which the graph distance of a pair of vertices…

Graph rigidity theory studies the capability of a graph embedded in the Euclidean space to constrain its global geometric shape via local constraints among nodes and edges, and has been widely exploited in network localization and formation…

We study the dynamics of a piecewise map defined on the set of three pairwise nonparallel, nonconcurrent lines in $\mathbb{R}^2$. The geometric map of study may be analogized to the billiard map with a different reflection rule so that each…

Let $G$ be a simple finite graph and $G'$ be a subgraph of $G$. A $G'$-design $(X,\cal B)$ of order $n$ is said to be embedded into a $G$-design $(X\cup U,\cal C)$ of order $n+u$, if there is an injective function $f:\cal B\rightarrow \cal…

The present paper opens a new branch in the theory of variational problems with branching extremals, the investigation of one-dimensional minimal fillings of finite pseudo-metric spaces. On the one hand, this problem is a one-dimensional…

Following Riemann's idea, we prove the existence of a minimal disk in Euclidean space bounded by three lines in generic position and with three helicoidal ends of angles less than $\pi$. In the case of general angles, we prove that there…

A (Euclidean) greedy drawing of a graph is a drawing in which, for any two vertices $s,t$ ($s \neq t$), there is a neighbor vertex of $s$ that is closer to $t$ than to $s$ in the Euclidean distance. Greedy drawings are important in the…

The Euclidean Steiner tree problem asks to find a min-cost metric graph that connects a given set of \emph{terminal} points $X$ in $\mathbb{R}^d$, possibly using points not in $X$ which are called Steiner points. Even though near-linear…

We show that the geometry of minimum spanning trees (MST) on random graphs is universal. Due to this geometric universality, we are able to characterise the energy of MST using a scaling distribution ($P(\epsilon)$) found using uniform…

The aim of this paper is to prove isoperimetric inequalities for simplices and polytopes with $d+2$ vertices in Euclidean, spherical and hyperbolic $d$-space. In particular, we find the minimal volume $d$-dimensional hyperbolic simplices…

Let $G$ be a graph of order $n$ with eigenvalues $\lambda_1 \geq \cdots \geq\lambda_n$. Let \[s^+(G)=\sum_{\lambda_i>0} \lambda_i^2, \qquad s^-(G)=\sum_{\lambda_i<0} \lambda_i^2.\] The smaller value, $s(G)=\min\{s^+(G), s^-(G)\}$ is called…

A site-specific Gordian distance between two spatial embeddings of an abstract graph is the minimal number of crossing changes from one to another where each crossing change is performed between two previously specified abstract edges of…

Graph theoretical problems based on shortest paths are at the core of research due to their theoretical importance and applicability. This paper deals with the geodetic number which is a global measure for simple connected graphs and it…

Let a \neq b be two positive scalars. A Euclidean representation of a simple graph G in R^r is a mapping of the nodes of G into points in R^r such that the squared Euclidean distance between any two points is a if the corresponding nodes…

We consider a class of generalized antiferromagnetic local/nonlocal interaction functionals in general dimension, where a short range attractive term of perimeter type competes with a long range repulsive term characterized by a reflection…

A connected graph $G$ with at least two vertices is matching covered if each of its edges lies in a perfect matching. A matching covered graph is minimal if the removal of any edge results in a graph that is no longer matching covered. An…

Many real-world networks describe systems in which interactions decay with the distance between nodes. Examples include systems constrained in real space such as transportation and communication networks, as well as systems constrained in…

In this thesis, we study value distribution theoretical properties of the Gauss map of pseudo-algebraic minimal surfaces in n-dimensional Euclidean space. After reviewing basic facts, we give estimates for the number of exceptional values…

The Shortest Cycle Cover Conjecture of Alon and Tarsi asserts that the edges of every bridgeless graph with $m$ edges can be covered by cycles of total length at most $7m/5=1.400m$. We show that every cubic bridgeless graph has a cycle…