Search Results for ""

The (m,n)-lollipop graph is the graph obtained by joining a complete graph K_m to a path graph P_n with a bridge. Precomputed properties of lollipop graphs are available in ...

The longhorn graph is the graph on 7 vertices illustrated above. It is implemented in the Wolfram Language as GraphData["LonghornGraph"].

A circle that in internally tangent to two sides of a triangle and to the circumcircle is called a mixtilinear incircle. There are three mixtilinear incircles, one ...

An NSW number (named after Newman, Shanks, and Williams) is an integer m that solves the Diophantine equation 2n^2=m^2+1. (1) In other words, the NSW numbers m index the ...

Let T_1 be the point at which the J_1-excircle meets the side A_2A_3 of a triangle DeltaA_1A_2A_3, and define T_2 and T_3 similarly. Then the lines A_1T_1, A_2T_2, and A_3T_3 ...

The net graph is the graph on 6 vertices illustrated above. It is implemented in the Wolfram Language as GraphData["NetGraph"]. The bipartite double graph of the net graph is ...

The polar coordinates r (the radial coordinate) and theta (the angular coordinate, often called the polar angle) are defined in terms of Cartesian coordinates by x = ...

There are several related theorems involving Hamiltonian cycles of graphs that are associated with Pósa. Let G be a simple graph with n graph vertices. 1. If, for every k in ...

Hardy and Littlewood (1914) proved that the sequence {frac(x^n)}, where frac(x) is the fractional part, is equidistributed for almost all real numbers x>1 (i.e., the ...

The Riemann-Siegel formula is a formula discovered (but not published) by Riemann for computing an asymptotic formula for the Riemann-Siegel function theta(t). The formula ...