Geometric intersection graphs form an intriguing class of structures in which vertices represent geometric objects – such as line segments, discs, or curves – and an edge is established between two ...

A pair of mathematicians solved a legendary question about the proportion of vertices in a graph with an odd number of connections. “It’s a bit of a surprise, at least for me, that such a combination ...

Journal of Applied Probability, Vol. 47, No. 3 (SEPTEMBER 2010), pp. 826-840 (15 pages) A random intersection graph G(n, m, p) is defined on a set 𝓥 of n vertices. There is an auxiliary set 𝓦 ...

This is a preview. Log in through your library . Abstract Let HG(x, y) be the expected hitting time from vertex x to vertex y for the first time on a simple connected graph G and φ(G) = ...