Related papers: Towards Constructing Geodesic Nets with Four Bound…

We construct a geodesic net in the plane with four unbalanced (boundary) vertices that has 16 balanced vertices and does not contain proper geodesic subnets. This is the first example of an irreducible geodesic net in the Euclidean plane…

We prove that a geodesic net with three boundary (= unbalanced) vertices on a non-positively curved plane has at most one balanced vertex. We do not assume any a priori bound for the degrees of unbalanced vertices. The result seems to be…

Geodesic nets are types of graphs in Riemannian manifolds where each edge is a geodesic segment. One important object used in the construction of geodesic nets is a balanced vertex, where the sum of unit tangent vectors along adjacent edges…

Geodesic nets on Riemannian manifolds form a natural class of stationary objects generalizing geodesics. Yet almost nothing is known about their classification or general properties even when the ambient Riemannian manifold is the Euclidean…

Define a boundary point of a graph which is embedded in the Euclidean plane a vertex which is incident to only one edge. In this paper we consider graphs which are embedded in the Euclidean plane with a finite number of boundary points. The…

We prove that every homogeneous convex polyhedron with only one unstable equilibrium (known as a mono-unstable convex polyhedron) has at least $7$ vertices. Although it has been long known that no mono-unstable tetrahedra exist, and…

We construct convex bodies that can be "captured by nets." More precisely, for each dimension $n \geq 2$, we construct a family of Riemannian $n$-spheres, each with a stable geodesic net, which is a stable 1-dimensional integral varifold.…

We study mechanical structures composed of spatial four-bar linkages that are bistable, that is, they allow for two distinct configurations. They have an interpretation as quad nets in the Study quadric which can be used to prove existence…

Let \( G \) be a finite simple undirected graph. Four graph parameters related to network monitoring are the \emph{geodetic set}, \emph{edge geodetic set}, \emph{strong edge geodetic set}, and \emph{monitoring edge geodetic set}, with…

In this paper we establish bounds on the number of vertices for a few classes of convex sublattice-free lattice polygons. The bounds are essential for proving the formula for the critical number of vertices of a lattice polygon that ensures…

In a rooted tree, we call a vertex {\em balanced} if it is at equal distance from all its descendant leaves. We count balanced vertices in three different tree varieties. For decreasing binary trees, we can prove that the probability that a…

A set S of vertices of a graph G is a geodesic transversal of G if every maximal geodesic of G contains at least one vertex of S. We determine a smallest geodesic transversal in certain interconnection networks such as mesh of trees, and…

Flexible network design deals with building a network that guarantees some connectivity requirements between its vertices, even when some of its elements (like vertices or edges) fail. In particular, the set of edges (resp. vertices) of a…

We find a new structural feature of equilibrium complex random networks without multiple and self-connections. We show that if the number of connections is sufficiently high, these networks contain a core of highly interconnected vertices.…

Let $G$ be a connected undirected graph on $n$ vertices with no loops but possibly multiedges. Given an arithmetical structure $(\textbf{r}, \textbf{d})$ on $G$, we describe a construction which associates to it a graph $G'$ on $n-1$…

Using closure concepts, we show that within every undirected network, or graph, there is a unique irreducible subgraph which we call its "spine". The chordless cycles which comprise this irreducible core effectively characterize the…

We show that any two non-conjugate points on a forward or backward complete connected Finsler manifold can be joined by infinitely many geodesics which are not covered by finitely many closed ones, provided that the Betti numbers of the…

We study the slices or sections of a convex polytope by affine hyperplanes. We present results on two key problems: First, we provide tight bounds on the maximum number of vertices attainable by a hyperplane slice of $d$-polytope (a sort of…

We show that every cubic bridgeless graph with n vertices has at least 3n/4-10 perfect matchings. This is the first bound that differs by more than a constant from the maximal dimension of the perfect matching polytope.

A graph on $n \ge 3$ vertices drawn in the plane such that each edge is crossed at most four times has at most $6(n-2)$ edges -- this result proven by Ackerman is outstanding in the literature of beyond-planar graphs with regard to its…