Search Results for ""
1971 - 1980 of 2413 for Napoleon's TheoremSearch Results
![](/common/images/search/spacer.gif)
A tree is a mathematical structure that can be viewed as either a graph or as a data structure. The two views are equivalent, since a tree data structure contains not only a ...
Given a triangle center X=l:m:n, the line mnalpha+nlbeta+lmgamma=0, where alpha:beta:gamma are trilinear coordinates, is called the trilinear polar (Kimberling 1998, p. 38). ...
Let G be Gauss's constant and M=1/G be its multiplicative inverse. Then M/sqrt(2)=0.8472130... (OEIS A097057) is sometimes known as the ubiquitous constant (Spanier and ...
Consider expressions built up from variables and constants using function symbols. If v_1, ..., v_n are variables and t_1, ..., t_n are expressions, then a set of mappings ...
In an integral domain R, the decomposition of a nonzero noninvertible element a as a product of prime (or irreducible) factors a=p_1...p_n, (1) is unique if every other ...
The unsorted union of a list S is a list containing the same elements as S but with the second and subsequent occurrence of any given element removed. For example, the ...
A characterization of normal spaces which states that a topological space X is normal iff, for any two nonempty closed disjoint subsets A, and B of X, there is a continuous ...
A variety is a class of algebras that is closed under homomorphisms, subalgebras, and direct products. Examples include the variety of groups, the variety of rings, the ...
Let gamma(G) denote the domination number of a simple graph G. Then Vizing (1963) conjectured that gamma(G)gamma(H)<=gamma(G×H), where G×H is the graph product. While the ...
A weighted adjacency matrix A_f of a simple graph is defined for a real positive symmetric function f(d_i,d_j) on the vertex degrees d_i of a graph as ...
![](/common/images/search/spacer.gif)
...