Search Results for ""

The word "degree" has many meanings in mathematics. The most common meaning is the unit of angle measure defined such that an entire rotation is 360 degrees. This unit harks ...

Let DeltaA^'B^'C^' be a triangle perspective to a reference triangle DeltaABC with perspector D^(''). Let A^('') be the intersection of lines BC^' and CB^', B^('') the ...

A graph G is said to be disconnected if it is not connected, i.e., if there exist two nodes in G such that no path in G has those nodes as endpoints. The numbers of ...

An edge-induced subgraph is a subset of the edges of a graph G together with any vertices that are their endpoints. The subgraph induced by a set of edges can be computed in ...

The edge count of a graph g, commonly denoted M(g) or E(g) and sometimes also called the edge number, is the number of edges in g. In other words, it is the cardinality of ...

The exterior angle bisectors (Johnson 1929, p. 149), also called the external angle bisectors (Kimberling 1998, pp. 18-19), of a triangle DeltaABC are the lines bisecting the ...

The extouch triangle DeltaT_1T_2T_3 is the triangle formed by the points of tangency of a triangle DeltaA_1A_2A_3 with its excircles J_1, J_2, and J_3. The points T_1, T_2, ...

Let f be a fractional coloring of a graph G. Then the sum of values of f is called its weight, and the minimum possible weight of a fractional coloring is called the ...

The golden gnomon is the obtuse isosceles triangle whose ratio of side to base lengths is given by 1/phi=phi-1, where phi is the golden ratio. Such a triangle has angles of ...

A Haar graph H(n) is a bipartite regular indexed by a positive integer and obtained by a simple binary encoding of cyclically adjacent vertices. Haar graphs may be connected ...