In this paper we study the impact of random exponential edge weights on the distances in a random graph and, in particular, on its diameter. Our main result consists of a precise asymptotic expression ...
Let 𝑅 be any subring of the reals. We present a generalization of linear systems on graphs where divisors are 𝑅-valued functions on the set of vertices and graph edges are permitted to have ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback