Related papers: Triple-loop networks with arbitrarily many minimum…
The cycle prefix network is a Cayley coset digraph based on sequences over an alphabet which has been proposed as a vertex symmetric communication network. This network has been shown to have many remarkable communication properties such as…
Motivated by results of Henry, Pralat and Zhang (PNAS 108.21 (2011): 8605-8610), we propose a general scheme for evolving spatial networks in order to reduce their total edge lengths. We study the properties of the equilbria of two networks…
We consider the problem of adding a fixed number of new edges to an undirected graph in order to minimize the diameter of the augmented graph, and under the constraint that the number of edges added for each vertex is bounded by an integer.…
Spin networks, essentially labeled graphs, are ``good quantum numbers'' for the quantum theory of geometry. These structures encompass a diverse range of techniques which may be used in the quantum mechanics of finite dimensional systems,…
Networks are widely used to model the contact structure within a population and in the resulting models of disease spread. While networks provide a high degree of realism, the analysis of the exact model is out of reach and even numerical…
For various purposes and, in particular, in the context of data compression, a graph can be examined at three levels. Its structure can be described as the unlabeled version of the graph; then the labeling of its structure can be added; and…
Metro or transit maps, are schematic representations of transit networks to facilitate effective route-finding. These maps are often advertised on a web page or pamphlet highlighting routes from source to destination stations. To visually…
Analogous to a classical knot diagram, a surface-link can be generically projected to 3-space and given crossing information to create a broken sheet diagram. The triple point number of a surface-link is the minimal number of triple points…
Polymer networks invariably possess topological inhomogeneities in the form of loops and dangling ends. The macroscopic properties of such materials are directly dependent on the local cyclic topology around nodes and chains. Here, a new…
In this paper, we study the problem of computing a minimum-width double-strip or parallelogram annulus that encloses a given set of $n$ points in the plane. A double-strip is a closed region in the plane whose boundary consists of four…
Among the several topological properties of complex networks, the shortest path represents a particularly important characteristic because of its potential impact not only on other topological properties, but mainly for its influence on…
We study the minimum Manhattan network problem, which is defined as follows. Given a set of points called \emph{terminals} in $\R^d$, find a minimum-length network such that each pair of terminals is connected by a set of axis-parallel line…
" How well connected is the network? " This is one of the most fundamental questions one would ask when facing the challenge of designing a communication network. Three major notions of connectivity have been considered in the literature,…
`Double edge swaps' transform one graph into another while preserving the graph's degree sequence, and have thus been used in a number of popular Markov chain Monte Carlo (MCMC) sampling techniques. However, while double edge-swaps can…
In this paper we study the impact of degree correlations in the subgraphs statistics of scale-free networks. In particular we consider loops: a simple case of network subgraphs which encode the redundancy of the paths passing through every…
Network motifs can capture basic interaction patterns and inform the functional properties of networks. However, real-world complex systems often have multiple types of relationships, which cannot be represented by a monolayer network. The…
Distance labeling schemes are schemes that label the vertices of a graph with short labels in such a way that the distance between any two vertices $u$ and $v$ can be determined efficiently by merely inspecting the labels of $u$ and $v$,…
The \emph{distance-number} of a graph $G$ is the minimum number of distinct edge-lengths over all straight-line drawings of $G$ in the plane. This definition generalises many well-known concepts in combinatorial geometry. We consider the…
Let G be an edge weighted undirected graph. For every pair of nodes consider the shortest cycle containing these nodes in G. The cycle diameter of G is the maximum length of a cycle in this set. Let H be a directed graph obtained by…
A graph is chordal if it does not contain an induced cycle of length greater than three. We determine the minimum size of a chordal graph with given order and minimum degree. In doing so, we have discovered interesting properties of chordal…