Related papers: Diameter formulas for a class of undirected multi-…
Token ring topology has been frequently used in the design of distributed loop computer networks and one measure of its performance is the diameter. We propose an algorithm for constructing hamiltonian graphs with $n$ vertices and maximum…
Erd\H{o}s, Pach, Pollack, and Tuza [\textit{J. Combin. Theory Ser. B, 47(1) (1989), 73-79}] proved that the diameter of a connected $n$-vertex graph with minimum degree $\delta$ is at most $\frac{3n}{\delta+1}+O(1)$. The oriented diameter…
We consider the localization number and metric dimension of certain graphs of diameter $2$, focusing on families of Kneser graphs and graphs without 4-cycles. For the Kneser graphs with diameter $2$, we find upper and lower bounds for the…
The diameter of a disc filling a loop in the universal covering of a Riemannian manifold may be measured extrinsically using the distance function on the ambient space or intrinsically using the induced length metric on the disc.…
In 2013, Bollob\'as, Mitsche, and Pralat at gave upper and lower bounds for the likely metric dimension of random Erd\H{o}s-R\'enyi graphs $G(n,p)$ for a large range of expected degrees $d=pn$. However, their results only apply when $d \ge…
In this paper we study the diameter of the random graph $G(n,p)$, i.e., the the largest finite distance between two vertices, for a wide range of functions $p=p(n)$. For $p=\la/n$ with $\la>1$ constant, we give a simple proof of an…
Two new classes of networks are introduced that resemble small-world properties. These networks are recursively constructed but retain a fixed, regular degree. They consist of a one-dimensional lattice backbone overlayed by a hierarchical…
Recently, the first author proposed a measure to calculate Pearson correlations for node values expressed in a network, by taking into account distances or metrics defined on the network. In this technical note, we show that using an…
We prove large-time $L^2$ and distributional limit theorems for perimeter and diameter of the convex hull of $N$ trajectories of planar random walks whose increments have finite second moments. Earlier work considered $N \in \{1,2\}$ and…
The diameter of an undirected or a directed graph is defined to be the maximum shortest path distance over all pairs of vertices in the graph. Given an undirected graph $G$, we examine the problem of assigning directions to each edge of $G$…
We consider the complete graph $\cK_n$ on $n$ vertices with exponential mean $n$ edge lengths. Writing $C_{ij}$ for the weight of the smallest-weight path between vertex $i,j\in [n]$, Janson showed that $\max_{i,j\in [n]} C_{ij}/\log{n}$…
Using unitarity methods, we compute, for several massive two-dimensional models, the cut-constructible part of the one-loop 2->2 scattering S-matrices from the tree-level amplitudes. We apply our method to various integrable theories,…
We derive an asymptotic formula for the number of strongly connected digraphs with $n$ vertices and $m$ arcs (directed edges), valid for $m-n\to\infty$ as $n\to \infty$ provided $m=O(n\log n)$. This fills the gap between Wright's results…
Let us denote elements of the symmetric group $S_n$ using square brackets for the one-line notation. Cycles will be represented using parentheses, following the standard cycle notation. Under this convention, the full reversal of the…
We develop a framework for algorithms finding the diameter in graphs of bounded distance Vapnik-Chervonenkis dimension, in (parameterized) subquadratic time complexity. The class of bounded distance VC-dimension graphs is wide, including,…
Several powerful techniques for evaluating massless scalar Feynman diagrams are developed, viz: the solution of recurrence relations to evaluate diagrams with arbitrary numbers of loops in $n=4-2\omega$ dimensions; the discovery and use of…
We show that the diameter of a uniformly drawn spanning tree of a connected graph on $n$ vertices which satisfies certain high-dimensionality conditions typically grows like $\Theta(\sqrt{n})$. In particular this result applies to…
We consider the set of finite sequences of length n over a finite or countable alphabet C. We consider the function which associate each given sequence with the size of the maximum overlap with a (shifted) copy of itself. We compute the…
We review a reduction formula by Petersson that reduces the calculation of a one-loop amplitude with N external lines in n<N space-time dimensions to the case n=N and give it a geometric interpretation. In the case n=N the calculation of…
The massless sunrise diagram with an arbitrary number of loops is calculated in a simple but formal manner. The result is then verified by rigorous mathematical treatment. Pitfalls in the calculation with distributions are highlighted and…