Related papers: Diameter formulas for a class of undirected multi-…
We consider the degree-diameter problem for undirected and directed circulant graphs. To date, attempts to generate families of large circulant graphs of arbitrary degree for a given diameter have concentrated mainly on the diameter 2 case.…
Inspired by Pythagoras's belief that numbers are the absolute reality, we obtain some demonstrational results about topological properties of integer networks, in which the vertices represent integers and two vertices are neighbors if and…
We study the distribution of diameters d of Erd\"os-R\'enyi random graphs with average connectivity c. The diameter d is the maximum among all shortest distances between pairs of nodes in a graph and an important quantity for all dynamic…
In this paper, free boundary geodesic networks whose length realize the first min-max width of the length functional are investigated. This functional acts on the space of relative flat 1-dimensional cycles modulo 2 in a compact surface…
A nonsplit graph is a directed graph where each pair of nodes has a common incoming neighbor. We show that the radius of such graphs is in $O(\log \log n)$, where $n$ is the number of nodes. We then generalize the result to products of…
An $(r,z,k)$-mixed graph $G$ has every vertex with undirected degree $r$, directed in- and out-degree $z$, and diameter $k$. In this paper, we study the case $r=z=1$, proposing some new constructions of $(1,1,k)$-mixed graphs with a large…
Characterizing multiloop topologies is an important step towards developing novel methods at high perturbative orders in quantum field theory. In this article, we exploit the Loop-Tree Duality (LTD) formalism to analyse multiloop topologies…
We determine the diameter of every connected component of the complement of the power graph and the enhanced power graph of a finite group, which completely answers two questions by Peter J. Cameron.
For any edge weight distribution, we consider the uniform spanning tree (UST) on finite graphs with i.i.d. random edge weights. We show that, for bounded degree expander graphs and finite boxes of ${\mathbb Z}^d$, the diameter of the UST is…
In this paper we derive results concerning the connected components and the diameter of random graphs with an arbitrary i.i.d. degree sequence. We study these properties primarily, but not exclusively, when the tail of the degree…
We study the diameter of LPS Ramanujan graphs $X_{p,q}$. We show that the diameter of the bipartite Ramanujan graphs is greater than $ (4/3)\log_{p}(n) +O(1)$ where $n$ is the number of vertices of $X_{p,q}$. We also construct an infinite…
The network coding problem asks whether data throughput in a network can be increased using coding (compared to treating bits as commodities in a flow). While it is well-known that a network coding advantage exists in directed graphs, the…
We derive a Belief-Propagation algorithm for counting large loops in a directed network. We evaluate the distribution of the number of small loops in a directed random network with given degree sequence. We apply the algorithm to a few…
Let K be a tame knot with irreducible exterior M(K) in a closed, connected, orientable 3--manifold Sigma such that pi_1(Sigma) is cyclic. If infinity is not a strict boundary slope, then the diameter of the set of strict boundary slopes of…
Let $\{U_n\}_{n \geq 0}$ and $\{V_m\}_{m \geq 0}$ be two linear recurrence sequences. We establish an asymptotic formula for the number of integers $c$ in the range $[-x, x]$ which can be represented as differences $ U_n - V_m$. In…
Computing the diameter of the intersection graphs of objects is a basic problem in computational geometry. Previous works showed that the complexity of computing the diameter mainly depends on the object types: for unit disks and squares in…
First principle network models are crucial to make sense of the intricate topology of real complex networks. While modeling efforts have been quite successful in undirected networks, generative models for networks with asymmetric…
The metric dimension of a graph $G$ is defined as the minimum number of vertices in a subset $S\subset V(G)$ such that all other vertices are uniquely determined by their distances to the vertices in $S$, and is denoted by $\dim(G)$. In…
Let $\mathcal{C}_1$ denote the largest connected component of the critical Erd\H{o}s--R\'{e}nyi random graph $G(n,{\frac{1}{n}})$. We show that, typically, the diameter of $\mathcal{C}_1$ is of order $n^{1/3}$ and the mixing time of the…
We give a simplified version of the proofs that, outside of their isolated vertices, the complement of the enhanced power graph and of the power graph are connected of diameter at most $3$.