TOPICS
Search

Search Results for ""


10761 - 10770 of 13135 for OTHER ANALYSISSearch Results
A simple way to describe a knot projection. The advantage of this notation is that it enables a knot diagram to be drawn quickly. For an oriented alternating knot with n ...
The Droz-Farny circles are a pair of circles of equal radius obtained by particular geometric constructions. The following amazing property of a triangle, first given by ...
If two perpendicular lines are drawn through the orthocenter H of any triangle, these lines intercept each side (or its extension) in two points (labeled P_(12), P_(12)^', ...
[scale=.3]/troves/MathOzTeX/graphics/gifs/melencol.jpg Dürer's magic square is a magic square with magic constant 34 used in an engraving entitled Melencolia I by Albrecht ...
The base-12 number system composed of the digits 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B. Such a system has been advocated by no less than Herbert Spencer, John Quincy Adams, and ...
The EKG sequence is the integer sequence having 1 as its first term, 2 as its second, and with each succeeding term being the smallest number not already used that shares a ...
The eban numbers are the sequence of numbers whose names (in English) do not contain the letter "e" (i.e., "e" is "banned"). The name was coined by N. J. A. Sloane around ...
A (p,q)-graph is edge-graceful if the edges can be labeled 1 through q in such a way that the labels induced on the vertices by summing over incident edges modulo p are ...
The edge chromatic number, sometimes also called the chromatic index, of a graph G is fewest number of colors necessary to color each edge of G such that no two edges ...
Let c_k be the number of edge covers of a graph G of size k. Then the edge cover polynomial E_G(x) is defined by E_G(x)=sum_(k=0)^mc_kx^k, (1) where m is the edge count of G ...

...