TOPICS
Search

Search Results for ""


12731 - 12740 of 13135 for Combinatorial AnalysisSearch Results
The pentakis icosidodecahedral graph, illustrated above, is a graph on 42 vertices that is the skeleton of the pentakis icosidodecahedron.
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 ...
Percolation, the fundamental notion at the heart of percolation theory, is a difficult idea to define precisely though it is quite easy to describe qualitatively. From the ...
A perfect graph is a graph G such that for every induced subgraph of G, the clique number equals the chromatic number, i.e., omega(G)=chi(G). A graph that is not a perfect ...
A periodic continued fraction is a continued fraction (generally a regular continued fraction) whose terms eventually repeat from some point onwards. The minimal number of ...
The Perkel graph is a weakly regular graph on 57 vertices and 171 edges, shown above in several embeddings. It is the unique distance-regular graph with intersection array ...
A permutation, also called an "arrangement number" or "order," is a rearrangement of the elements of an ordered list S into a one-to-one correspondence with S itself. The ...
A permutation cycle is a subset of a permutation whose elements trade places with one another. Permutations cycles are called "orbits" by Comtet (1974, p. 256). For example, ...
The integer sequence defined by the recurrence P(n)=P(n-2)+P(n-3) (1) with the initial conditions P(0)=3, P(1)=0, P(2)=2. This recurrence relation is the same as that for the ...
The beautiful arrangement of leaves in some plants, called phyllotaxis, obeys a number of subtle mathematical relationships. For instance, the florets in the head of a ...

...