TOPICS
Search

Search Results for ""


1311 - 1320 of 2058 for Sierpinski Sieve GraphSearch Results
A cubic map is three-colorable iff each interior region is bounded by an even number of regions. A non-cubic map bounded by an even number of regions is not necessarily ...
A matrix for a round-robin tournament involving n players competing in n(n-1)/2 matches (no ties allowed) having entries a_(ij)={1 if player i defeats player j; -1 if player ...
A tripod is a tree having exactly three tree leaves (Pirnazar and Ullman 2002). The numbers of tripods on n=1, 2, ... vertices are 0, 0, 0, 1, 1, 2, 3, 4, 5, 7, 8, 10, 12, ...
Complete digraphs are digraphs in which every pair of nodes is connected by a bidirectional edge.
An Egyptian fraction is a sum of positive (usually) distinct unit fractions. The famous Rhind papyrus, dated to around 1650 BC contains a table of representations of 2/n as ...
The totient function phi(n), also called Euler's totient function, is defined as the number of positive integers <=n that are relatively prime to (i.e., do not contain any ...
The 24-cell is a finite regular four-dimensional polytope with Schläfli symbol {3,4,3}. It is also known as the hyperdiamond or icositetrachoron, and is composed of 24 ...
The empire problem, also known as the m-pire problem) asks for the maximum number of colors needed to color countries such that no two countries sharing a common border have ...
The term energy has an important physical meaning in physics and is an extremely useful concept. There are several forms energy defined in mathematics. In measure theory, let ...
Given n matches (i.e., rigid unit line segments), find the number of topologically distinct planar arrangements which can be made (Gardner 1991). In this problem, two matches ...
1 ... 129|130|131|132|133|134|135 ... 206 Previous Next

...