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 ...
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 π¦ ...
Abstract We calculate the intersection ring of 3-dimensional graph manifolds with rational coefficients and give an algebraic characterization of these rings when the manifoldβs underlying graph is a ...
At the International Workshop on Combinatorial Image Analysis, held in Brno, Czech Republic, our URGE To Compute team received the Best Student Paper Award for their presentation, "On Intersection ...
Citations: Deijfen, M., Willemien Kets. 2009. Random intersection graphs with a tunable degree distribution and clustering. Probability in the Engineering and Informational Sciences. 661-674.
A graph G with vertex set V is said to be n-existentially closed (or n-e.c. for short) if, for every proper subset S of V with |S|=n and every subset T of S, there exists a vertex x in V-S such that x ...
Simultaneous equations like π = 2π - 1 and π = π + 1 can be represented graphically. To solve the equations graphically, the two lines π = π + 1 and π = 2π - 1 are drawn on the same diagram.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback