Search Results for ""
1161 - 1170 of 1616 for Degenerate TriangleSearch Results
Let a spherical triangle have sides a, b, and c with A, B, and C the corresponding opposite angles. Then (sin[1/2(a-b)])/(sin(1/2c)) = (sin[1/2(A-B)])/(cos(1/2C)) (1) ...
The golden angle is the angle that divides a full angle in a golden ratio (but measured in the opposite direction so that it measures less than 180 degrees), i.e., GA = ...
A two-coloring of a complete graph K_n of n nodes which contains exactly the number of monochromatic forced triangles and no more (i.e., a minimum of R+B where R and B are ...
Let (a)_i be a sequence of complex numbers and let the lower triangular matrices F=(f)_(nk) and G=(g)_(nk) be defined as f_(nk)=(product_(j=k)^(n-1)(a_j+k))/((n-k)!) and ...
The coarseness xi(G) of a graph G is the maximum number of edge-disjoint nonplanar subgraphs contained in a given graph G. The coarseness of a planar graph G is therefore ...
Any one of the eight Apollonius circles of three given circles is tangent to a circle H known as a Hart circle, as are the other three Apollonius circles having (1) like ...
When the elongated square pyramid with unit edge lengths (i.e., an equilateral obelisk) is truncated by a plane passing through opposite corners of its square base and the ...
A hexagon is a six-sided polygon. Several special types of hexagons are illustrated above. In particular, a hexagon with vertices equally spaced around a circle and with all ...
A polyiamond composed of six equilateral triangles. The 12 hexiamonds are illustrated above. They are given the names bar, crook, crown, sphinx, snake, yacht, chevron, ...
The Higman-Sims graph is the unique strongly regular graph on 100 nodes (Higman and Sims 1968, Brouwer 1983, Brouwer and Haemers 1993). It was also constructed independently ...
...
View search results from all Wolfram sites (5028 matches)

