Search Results for ""

In the triangle DeltaABC illustrated above, side c subtends angle ∠C. More generally, given a geometric object O in the plane and a point P, let A be the angle from one edge ...

subjMathematics:Discrete Mathematics:Graph Theory:Cliques The maximal clique polynomial C_G(x) for the graph G may be defined as the polynomial ...

R. C. Read defined the anarboricity of a graph G as the maximum number of edge-disjoint nonacyclic (i.e., cyclic) subgraphs of G whose union is G (Harary and Palmer 1973, p. ...

A number of graphs are associated with P. J. Owens. The 76-node Owens graph (Owens 1980) provides the smallest known example of a polyhedral quintic nonhamiltonian graph. It ...

The regular tessellation {6,3} consisting of regular hexagons (i.e., a hexagonal grid). In general, the term honeycomb is used to refer to a tessellation in n dimensions for ...

A forest is an acyclic graph (i.e., a graph without any graph cycles). Forests therefore consist only of (possibly disconnected) trees, hence the name "forest." Examples of ...

The Moser spindle is the 7-node unit-distance graph illustrated above (Read and Wilson 1998, p. 187). It is sometimes called the Hajós graph (e.g., Bondy and Murty 2008. p. ...

Given a triangle DeltaABC and a point P not a vertex of DeltaABC, define the A^'-vertex of the circumcevian triangle as the point other than A in which the line AP meets the ...

For a nonzero real number r and a triangle DeltaABC, swing line segment BC about the vertex B towards vertex A through an angle rB. Call the line along the rotated segment L. ...

A regular skew polyhedron is a polyhedron whose faces and vertex figures are regular skew polygons. There are only three regular skew polyhedra in Euclidean three-space ...