Search Results for ""

Discrete Mathematics

A complete oriented graph (Skiena 1990, p. 175), i.e., a graph in which every pair of nodes is connected by a single uniquely directed edge. The first and second 3-node ...

The midsphere, also called the intersphere, reciprocating sphere, or inversion sphere, is a sphere with respect to which the polyhedron vertices of a polyhedron are the ...

A 2-dimensional discrete percolation model is said to be mixed if both graph vertices and graph edges may be "blocked" from allowing fluid flow (i.e., closed in the sense of ...

The parity of an integer is its attribute of being even or odd. Thus, it can be said that 6 and 14 have the same parity (since both are even), whereas 7 and 12 have opposite ...

A perpendicular bisector CD of a line segment AB is a line segment perpendicular to AB and passing through the midpoint M of AB (left figure). The perpendicular bisector of a ...

Proportionally cutting circles are circles that intersect the sidelines of a reference triangle DeltaABC such that length of the chords that are cut off have lengths mua, ...

There are a number of functions in various branches of mathematics known as Riemann functions. Examples include the Riemann P-series, Riemann-Siegel functions, Riemann theta ...

A median A_1M_1 of a triangle DeltaA_1A_2A_3 is the Cevian from one of its vertices A_1 to the midpoint M_1 of the opposite side. The three medians of any triangle are ...

The degree of a graph vertex v of a graph G is the number of graph edges which touch v. The vertex degrees are illustrated above for a random graph. The vertex degree is also ...