Search Results for ""

A cyclic polygon is a polygon with vertices upon which a circle can be circumscribed. Since every triangle has a circumcircle, every triangle is cyclic. It is conjectured ...

Let A_1, A_2, A_3, and A_4 be four points on a circle, and H_1, H_2, H_3, H_4 the orthocenters of triangles DeltaA_2A_3A_4, etc. If, from the eight points, four with ...

A principal vertex x_i of a simple polygon P is called an ear if the diagonal [x_(i-1),x_(i+1)] that bridges x_i lies entirely in P. Two ears x_i and x_j are said to overlap ...

A quadrilateral in which a pair of opposite sides have the same length and are inclined at 60 degrees to each other (or equivalently, satisfy <A>+<B>=120 degrees). Some ...

The line on which the orthocenter H, triangle centroid G, circumcenter O, de Longchamps point L, nine-point center N, and a number of other important triangle centers lie. ...

Let psi = 1+phi (1) = 1/2(3+sqrt(5)) (2) = 2.618033... (3) (OEIS A104457), where phi is the golden ratio, and alpha = lnphi (4) = 0.4812118 (5) (OEIS A002390). Define the ...

The global clustering coefficient C of a graph G is the ratio of the number of closed trails of length 3 to the number of paths of length two in G. Let A be the adjacency ...

The Goddard-Henning enneahedron, a term coined here, is the canonical polyhedron obtained from the Goddard-Henning graph. It has 9 vertices, 16 edges (consisting of 3 ...

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 heptahedron is a polyhedron with seven faces. Because there are 34 heptahedral graphs, there are 34 topologically distinct convex heptahedra. There are three semiregular ...