Search Results for ""

The Biggs-Smith graph is cubic symmetric graph F_(102)A on 102 vertices and 153 edges that is also distance-regular with intersection array {3,2,2,2,1,1,1;1,1,1,1,1,1,3} and ...

The dodecahedral graph is the Platonic graph corresponding to the connectivity of the vertices of a dodecahedron, illustrated above in four embeddings. The left embedding ...

The mathematical study of the likelihood and probability of events occurring based on known information and inferred by taking a limited number of samples. Statistics plays ...

The Doyle graph, sometimes also known as the Holt graph (Marušič et al. 2005), is the quartic symmetric graph on 27 nodes illustrated above in several embeddings. It is ...

The Conway-Smith graph is a distance-transitive graph on 63 vertices having intersection array {10,6,4,1;1,2,6,10} (Hall 1980). It is also distance-transitive. It is denoted ...

There are (at least) two graphs associated with Ellingham and Horton. These graphs on 54 and 78 nodes respectively, illustrated above, are examples of 3-connected bicubic ...

In general, an extremal graph is the largest graph of order n which does not contain a given graph G as a subgraph (Skiena 1990, p. 143). Turán studied extremal graphs that ...

The Gosset graph is a 27-regular graph on 56 vertices which is the skeleton of the Gosset polytope 3_(21). It is a distance-regular graph with intersection array ...

In the field of percolation theory, the term percolation threshold is used to denote the probability which "marks the arrival" (Grimmett 1999) of an infinite connected ...

The 16-cell beta_4 is the finite regular four-dimensional cross polytope with Schläfli symbol {3,3,4}. It is also known as the hyperoctahedron (Buekenhout and Parker 1998) or ...