Search Results for ""

The least common multiple of two numbers a and b, variously denoted LCM(a,b) (this work; Zwillinger 1996, p. 91; Råde and Westergren 2004, p. 54), lcm(a,b) (Gellert et al. ...

The Lemke graph is the 8-node graph with 13 edges illustrated above (Lemke and Kleitman 1989, Hurlbert 2011, Hurlbert 2013). The Lemke graph is the smallest graph that does ...

The plots above show the values of the function obtained by taking the natural logarithm of the gamma function, lnGamma(z). Note that this introduces complicated branch cut ...

The Meringer graph is one of the four (5,5)-cage graphs, discovered by Meringer (1999) after it had long been thought that only three such cages existed. Like the other ...

The term metric signature refers to the signature of a metric tensor g=g_(ij) on a smooth manifold M, a tool which quantifies the numbers of positive, zero, and negative ...

The points of intersection of the adjacent angle trisectors of the angles of any triangle DeltaABC are the polygon vertices of an equilateral triangle DeltaDEF known as the ...

Knuth (2008, p. 44) terms the 24-vertex graph based on the notes of the musical scale illustrated above the "musical graph." This graph can be seen to be the 24-vertex case ...

The paw graph is the 3-pan graph, which is also isomorphic to the (3,1)-tadpole graph. It is implemented in the Wolfram Language as GraphData["PawGraph"].

That portion of geometry dealing with figures in a plane, as opposed to solid geometry. Plane geometry deals with the circle, line, polygon, etc.

A knot is called prime if, for any decomposition as a connected sum, one of the factors is unknotted (Livingston 1993, pp. 5 and 78). A knot which is not prime is called a ...