Search Results for ""

The nonnegative integers 0, 1, 2, ....

Course List

In continuum percolation theory, the Boolean-Poisson model is a Boolean model driven by a stationary point process X which is a Poisson process. The Boolean-Poisson model is ...

There are (at least) two graphs associated with Horton, illustrated above. The first is a graph on 96 nodes providing a counterexample to the Tutte conjecture that every ...

Isomorphic factorization colors the edges a given graph G with k colors so that the colored subgraphs are isomorphic. The graph G is then k-splittable, with k as the divisor, ...

Every nonplanar graph contains either the utility graph K_(3,3) (i.e., the complete bipartite graph on two sets of three vertices) or the pentatope graph K_5 as a ...

A uniquely pancyclic graph is a graph that has exactly one cycle of each length between 3 and the graph's vertex count. Uniquely pancyclic graphs are therefore a special case ...

If r is a root of a nonzero polynomial equation a_nx^n+a_(n-1)x^(n-1)+...+a_1x+a_0=0, (1) where the a_is are integers (or equivalently, rational numbers) and r satisfies no ...

A prism graph, denoted Y_n, D_n (Gallian 1987), or Pi_n (Hladnik et al. 2002), and sometimes also called a circular ladder graph and denoted CL_n (Gross and Yellen 1999, p. ...

A Turán graph, sometimes called a maximally saturated graph (Zykov 1952, Chao and Novacky 1982), with positive integer parameters n and k is a type of extremal graph on n ...