Related papers: Periodic Steiner networks minimizing length
These are some informal remarks on quadratic orbital networks over finite fields. We discuss connectivity, Euler characteristic, number of cliques, planarity, diameter and inductive dimension. We find a non-trivial disconnected graph for…
A well known theorem in graph theory states that every graph $G$ on $n$ vertices and minimum degree at least $d$ contains a path of length at least $d$, and if $G$ is connected and $n\ge 2d+1$ then $G$ contains a path of length at least…
We consider a variational model for periodic partitions of the upper half-space into three regions, where two of them have prescribed volume and are subject to the geometrical constraint that their union is the subgraph of a function, whose…
Entangled embedded periodic nets and crystal frameworks are defined, along with their dimension type, homogeneity type, adjacency depth and periodic isotopy type. We obtain periodic isotopy classifications for various families of embedded…
We introduce a temporal Steiner network problem in which a graph, as well as changes to its edges and/or vertices over a set of discrete times, are given as input; the goal is to find a minimal subgraph satisfying a set of $k$…
The graph layouts used for complex network studies have been mainly been developed to improve visualization. If we interpret the layouts in metric spaces such as Euclidean ones, however, the embedded spatial information can be a valuable…
We construct a one-parameter family of embedded doubly periodic minimal surfaces of genus three with four parallel ends. The Weierstrass data for each surface of the family are given and the two dimensional period problem is solved.
The Euclidean Steiner Minimal Tree problem takes as input a set $\mathcal P$ of points in the Euclidean plane and finds the minimum length network interconnecting all the points of $\mathcal P$. In this paper, in continuation to the works…
Networks provide a popular representation of complex data. Often, different types of relational measurements are taken on the same subjects. Such data can be represented as a \textit{multislice network}, a collection of networks on the same…
The Euclidean Steiner tree problem seeks the min-cost network to connect a collection of target locations, and it underlies many applications of wireless networks. In this paper, we present a study on solving the Euclidean Steiner tree…
Systematic enumeration of crystalline networks with some special topological characters is of considerable interest in both mathematics and crystallography. Based on the restriction of lattice in cubic and inequivalent nodes not exceeding…
Many real-world networks of interest are embedded in physical space. We present a new random graph model aiming to reflect the interplay between the geometries of the graph and of the underlying space. The model favors configurations with…
In this note, we give answers to three questions from the paper [A. Das, Triameter of graphs, Discuss. Math. Graph Theory, 41 (2021), 601--616]. Namely, we obtain a tight lower bound for the triameter of trees in terms of order and number…
We add two new 1-parameter families to the short list of known embedded triply periodic minimal surfaces of genus 4 in $\mathbb{R}^3$. Both surfaces can be tiled by minimal pentagons with two straight segments and three planar symmetry…
The number of embeddings of minimally rigid graphs in $\mathbb{R}^D$ is (by definition) finite, modulo rigid transformations, for every generic choice of edge lengths. Even though various approaches have been proposed to compute it, the gap…
In the Steiner Tree problem we are given an undirected edge-weighted graph as input, along with a set $K$ of vertices called terminals. The task is to output a minimum-weight connected subgraph that spans all the terminals. The famous…
Given a point set $P$ in the Euclidean space, a geometric $t$-spanner $G$ is a graph on $P$ such that for every pair of points, the shortest path in $G$ between those points is at most a factor $t$ longer than the Euclidean distance between…
The vertex connectivity of a graph $G$ is the size of the smallest set of vertices $S$ such that $G \setminus S$ is disconnected. For the class of planar graphs, the problem of vertex connectivity is well-studied, both from structural and…
We study three classical graph problems - Hamiltonian path, minimum spanning tree, and minimum perfect matching on geometric graphs induced by bichromatic (red and blue) points. These problems have been widely studied for points in the…
The boxicity of a graph is the smallest dimension $d$ allowing a representation of it as the intersection graph of a set of $d$-dimensional axis-parallel boxes. We present a simple general approach to determining the boxicity of a graph…