Search Results for ""
1291 - 1300 of 13134 for Extremal graph theorySearch Results
A fractal is an object or quantity that displays self-similarity, in a somewhat technical sense, on all scales. The object need not exhibit exactly the same structure at all ...
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 ...
An n-route is defined as a walk of length n with specified initial point in which no line succeeds itself.
The Hamming distance between two vertices of a hypercube is the number of coordinates at which the two vertices differ.
The pentatope is the simplest regular figure in four dimensions, representing the four-dimensional analog of the solid tetrahedron. It is also called the 5-cell, since it ...
Discrete Mathematics
The set of all centroid points in a weighted tree (Harary 1994, p. 36).
Araya and Wiener (2011) found the two cubic planar hypohamiltonian graphs on 70 and 88 vertices, respectively, illustrated above.
Gossiping and broadcasting are two problems of information dissemination described for a group of individuals connected by a communication network. In gossiping, every person ...
A Riemann surface is a surface-like configuration that covers the complex plane with several, and in general infinitely many, "sheets." These sheets can have very complicated ...
...
View search results from all Wolfram sites (34319 matches)

