Search Results for ""

The Meredith graph is a quartic nonhamiltonian graph on 70 nodes and 140 edges that is a counterexample to the conjecture that every 4-regular 4-connected graph is ...

The pentagonal hexecontahedral graph is the Archimedean dual graph which is the skeleton of the pentagonal hexecontahedron. It is implemented in the Wolfram Language as ...

The pentagonal icositetrahedral graph is the Archimedean dual graph which is the skeleton of the pentagonal icositetrahedron. It is implemented in the Wolfram Language as ...

Two lattice points (x,y) and (x^',y^') are mutually visible if the line segment joining them contains no further lattice points. This corresponds to the requirement that ...

The deltoidal hexecontahedral graph is an Archimedean dual graph which is the skeleton of the deltoidal hexecontahedron as well as the rhombic hexecontahedron. It is ...

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 ...

A cubic lattice is a lattice whose points lie at positions (x,y,z) in the Cartesian three-space, where x, y, and z are integers. The term is also used to refer to a regular ...

The parallel curves for (outward) offset k of an ellipse with semi-axis lengths a and b are given by x_p = (a+(bk)/(sqrt(a^2sin^2t+b^2cos^2t)))cost (1) y_p = ...

A curve obtained by fitting polynomials to each ordinate of an ordered sequence of points. The above plots show polynomial curves where the order of the fitting polynomial ...

The Cantor diagonal method, also called the Cantor diagonal argument or Cantor's diagonal slash, is a clever technique used by Georg Cantor to show that the integers and ...