Search Results for ""

n events are said to be mutually exclusive if the occurrence of any one of them precludes any of the others. Therefore, for events X_1, ..., X_n, the conditional probability ...

The probability that a variate would assume a value greater than or equal to the observed value strictly by chance: P(z>=z_(observed)).

The hemicubical graph is the skeleton of the hemicube. It has 7 vertices, 11 edges, and 6 faces. It is implemented in the Wolfram Language as GraphData["HemicubicalGraph"].

The truncated great dodecahedral graph is the skeleton of the small stellated truncated dodecahedron and truncated great dodecahedron. It is illustrated above in a number of ...

The truncated pentakis dodecahedral graph, illustrated above in a pair of embeddings, is the skeleton of the truncated pentakis dodecahedron. It has 180 vertices, 270 edges, ...

The dodecicosahedral graph is the skeleton graph of the great ditrigonal dodecicosidodecahedron, great dodecicosahedron, great icosicosidodecahedron, small ditrigonal ...

The great snub dodecicosidodecahedral graph is the skeleton of the great snub dodecicosidodecahedron, illustrated above in a few embeddings. It will be implemented in a ...

The small snub icosicosidodecahedral graph is the skeleton of the small retrosnub icosicosidodecahedron and small snub icosicosidodecahedron. It is illustrated above in a ...

The n-double cone graph is the name given in the work to the graphs that geometrically correspond to a double cone obtained by connecting all vertices of two C_n cycle graphs ...

The longhorn graph is the graph on 7 vertices illustrated above. It is implemented in the Wolfram Language as GraphData["LonghornGraph"].