Search Results for ""
1781 - 1790 of 2745 for Distance Regular GraphSearch Results
A pyramidal frustum is a frustum made by chopping the top off a pyramid. It is a special case of a prismatoid. For a right pyramidal frustum, let s be the slant height, h the ...
A number of attractive tetrahedron 10-compounds can be constructed. The first (left figures) can be obtained by combining tetrahedron 5-compounds of opposite chirality ...
Functions which have derivatives of all orders at all points and which, together with their derivatives, fall off at least as rapidly as |x|^(-n) as |x|->infty, no matter how ...
A 14-sided polygon, sometimes called a tetrakaidecagon.
A 13-sided polygon, sometimes also called the triskaidecagon.
The bound for the number of colors which are sufficient for map coloring on a surface of genus g, gamma(g)=|_1/2(7+sqrt(48g+1))_| is the best possible, where |_x_| is the ...
Given a map with genus g>0, Heawood showed in 1890 that the maximum number N_u of colors necessary to color a map (the chromatic number) on an unbounded surface is N_u = ...
The number of colors sufficient for map coloring on a surface of genus g is given by the Heawood conjecture, chi(g)=|_1/2(7+sqrt(48g+1))_|, where |_x_| is the floor function. ...
The Earth-Moon problem is a special case of the empire problem for countries with m=2 disjoint regions, with one region of each country lying on the Earth and one on the Moon ...
A generalization of Turán's theorem to non-complete graphs.
...
View search results from all Wolfram sites (19754 matches)

