Search Results for ""

The R graph is the graph on 6 vertices illustrated above. It is implemented in the Wolfram Language as GraphData["RGraph"].

There are at least two distinct notions of an intensity function related to the theory of point processes. In some literature, the intensity lambda of a point process N is ...

Ball and Coxeter (1987, pp. 277-278) define the ladder graph nP_2, here called the ladder rung graph, of order n as the graph union of n copies of the path graph P_2. The ...

The Hajós graph (Brandstädt et al. 1987, Berge 1989) is another name for the Sierpiński sieve graph S_2, which is isomorphic to the 2-sun graph. However, the term is also ...

The triangle graph is the cycle graph C_3, which is isomorphic to the complete graph K_3 as well as to the complete tripartite graph K_(3×1)=K_(1,1,1) and the triangular ...

The Wagner graph is a name sometimes given to the 4-Möbius ladder (Bondy and Murty 2008, pp. 275-276). The association arises through the theorem of Wagner (1937) that graphs ...

The small triakis octahedron graph is Archimedean dual graph which is the skeleton of the small triakis octahedron. It is implemented in the Wolfram Language as ...

Let {A_n}_(n=0)^infty be a sequence of events occurring with a certain probability distribution, and let A be the event consisting of the occurrence of a finite number of ...

Likelihood is the hypothetical probability that an event that has already occurred would yield a specific outcome. The concept differs from that of a probability in that a ...

The Eiffel Tower graph is the graph on 7 vertices illustrated above. (Note that Koren et al. (2003) use the term 'Eiffel Tower graph' to refer instead to the (3,2)-fan ...