Search Results for ""

Given a set S of points in the plane, an enclosing circle is a circle for which all points S lie in its interior.

Given a module M over a unit ring R, the set End_R(M) of its module endomorphisms is a ring with respect to the addition of maps, (f+g)(x)=f(x)+g(x), for all x in M, and the ...

Given two univariate polynomials of the same order whose first p coefficients (but not the first p-1) are 0 where the coefficients of the second approach the corresponding ...

The Goh-Schmutz constant is defined by the integrals C = int_0^infty(ln(1+t))/(e^t-1)dt (1) = int_0^inftyln[1-ln(1-e^(-t))]dt (2) = ...

The term in rigidity theory for the edges of a graph.

The composition G=G_1[G_2] of graphs G_1 and G_2 with disjoint point sets V_1 and V_2 and edge sets X_1 and X_2 is the graph with point vertex V_1×V_2 and u=(u_1,u_2) ...

Assignment of each graph edge of a graph to one of two color classes (commonly designation "red" and "green").

The dual of the great dodecahemidodecahedron U_(70) and Wenninger dual W_(107). When rendered, the great dodecahemidodecacron and great icosihemidodecacron look the same, ...

A formula satisfied by all Hamiltonian cycles with n nodes. Let f_j be the number of regions inside the circuit with j sides, and let g_j be the number of regions outside the ...

The Grötzsch graph is smallest triangle-free graph with chromatic number four. It is identical to the Mycielski graph of order four, and is implemented as ...